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

	Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande DocID: 1xV8b - View Document
	Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica DocID: 1vnjH - View Document
	Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping DocID: 1uXmk - View Document
	Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY DocID: 1uOCl - View Document
	Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica DocID: 1uNif - View Document