<--- Back to Details
First PageDocument Content
Finite automata / Levenshtein distance / Linguistics / Theoretical computer science / Finite-state transducer / Mathematics / Nested stack automaton
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

Similar Documents