Bisimilarity of Probabilistic Pushdown Automata Vojtěch Forejt1 , Petr Jančar2 , Stefan Kiefer1 , and James Worrell1 1 2 Department of Computer Science, University of Oxford, UK

First Page		Document Content
Date: 2013-12-01 10:21:43 Formal languages Mathematics Theoretical computer science Models of computation Discrete mathematics Nested word Words Bisimulation Distribution Deterministic pushdown automaton		Bisimilarity of Probabilistic Pushdown Automata Vojtěch Forejt1 , Petr Jančar2 , Stefan Kiefer1 , and James Worrell1 1 2 Department of Computer Science, University of Oxford, UK Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 565,29 KB Share Document on Facebook

	Bayesian Unsupervised Word Segmentation with Nested Pitman-Yor Language Modeling Daichi Mochihashi Takeshi Yamada Naonori Ueda NTT Communication Science Laboratories Hikaridai 2-4, Keihanna Science City, Kyoto, Japan {da DocID: 1tWlg - View Document
	Microsoft Word - non_nested classification in Argus.doc DocID: 1rpPc - View Document
	Microsoft Word - OCWD Nested Monitoring Wells Air Report6-1-16.doc DocID: 1pxYf - View Document
	Dense-Timed Pushdown Automata Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman DocID: 1md0V - View Document
	OpenNWA: A Nested-Word Automaton Library⋆ Evan Driscoll1 , Aditya Thakur1 , and Thomas Reps1,2 1 Computer Sciences Department, University of Wisconsin – Madison {driscoll,adi,reps}@cs.wisc.edu DocID: 1lkGp - View Document