<--- Back to Details
First PageDocument Content
Finite automata / Abstract algebra / Algebra / Finite-state transducer / Mathematics / Theoretical computer science / Finite-state machine / Semigroup action / Kazhdan's property / Tree transducer
Date: 2016-07-15 23:00:36
Finite automata
Abstract algebra
Algebra
Finite-state transducer
Mathematics
Theoretical computer science
Finite-state machine
Semigroup action
Kazhdan's property
Tree transducer

Lipschitz Robustness of Finite-state Transducers Thomas A. Henzinger, Jan Otop, Roopsha Samanta IST Austria Abstract We investigate the problem of checking if a finite-state transducer is robust to uncertainty in

Add to Reading List

Source URL: www.cs.purdue.edu

Download Document from Source Website

File Size: 565,19 KB

Share Document on Facebook

Similar Documents

Workshop GK 334, April 2, 2003  Efficiency Improvement by Tree Transducer Composition Janis Voigtl¨ ander

Workshop GK 334, April 2, 2003 Efficiency Improvement by Tree Transducer Composition Janis Voigtl¨ ander

DocID: 1sKhz - View Document

PDF Document

DocID: 1j4e8 - View Document

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

DocID: 18ga7 - View Document

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

DocID: 187Ea - View Document

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

DocID: 17EK6 - View Document