Robustness Analysis of String Transducers? Roopsha Samanta1 , Jyotirmoy V. Deshmukh2?? , and Swarat Chaudhuri3 1 University of Texas at Austin 2

First Page		Document Content
Date: 2016-07-15 23:00:36 Finite automata Levenshtein distance Linguistics Theoretical computer science Finite-state transducer Mathematics Nested stack automaton		Robustness Analysis of String Transducers? Roopsha Samanta1 , Jyotirmoy V. Deshmukh2?? , and Swarat Chaudhuri3 1 University of Texas at Austin 2 Add to Reading List Source URL: www.cs.purdue.edu Download Document from Source Website File Size: 373,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