Symbolic finite state transducers
Authors:
Open Access
- 25 January 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 137-150
Abstract
No abstract availableThis publication has 35 references indexed in Scilit:
- The Power of Extended Top-Down Tree TransducersSIAM Journal on Computing, 2009
- Data obfuscation: anonymity and desensitization of usable data setsIEEE Security & Privacy, 2004
- Finite state machines for strings over infinite alphabetsACM Transactions on Computational Logic, 2004
- Equivalence of finite-valued tree transducers is decidableTheory of Computing Systems, 1994
- Decomposing Finite-Valued Transducers and Deciding Their EquivalenceSIAM Journal on Computing, 1993
- On some decidable properties of finite state translationsActa Informatica, 1982
- Attribute grammars and recursive program schemes ITheoretical Computer Science, 1982
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and ApplicationsSIAM Journal on Computing, 1978
- Fourier-Motzkin elimination and its dualJournal of Combinatorial Theory, Series A, 1973
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machinesJournal of the ACM, 1968