Language Equivalence of Probabilistic Pushdown Automata Vojtˇech Forejta , Petr Janˇcarb , Stefan Kiefera , James Worrella a Department b Dept

First Page		Document Content
Date: 2014-05-20 08:33:12 Formal languages IP Mathematics Grammar Theoretical computer science Nested stack automaton Indexed grammar		Language Equivalence of Probabilistic Pushdown Automata Vojtˇech Forejta , Petr Janˇcarb , Stefan Kiefera , James Worrella a Department b Dept Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 316,40 KB Share Document on Facebook

	Dense-Timed Pushdown Automata Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman DocID: 1md0V - View Document
	JFP): 218–283, c Cambridge University Press 2014 ⃝ 218 DocID: 1lF8p - View Document
	COMS11700 Pushdown automata Ashley Montanaro Department of Computer Science, University of Bristol DocID: 11TOL - View Document
	Changes to JFLAP to Increase its Use in Courses ∗ Susan H. Rodger Henry Qin Jonathan Su DocID: Q4yV - View Document