Transforming a single-valued transducer into a Mealy machine

DOI10.1006/jcss.1997.1517zbMath0914.68137OpenAlexW1969639908MaRDI QIDQ1267709

Andreas Weber

Publication date: 21 June 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bc5e60d2e417414f501abdb71aa8bb24f82bb900

zbMATH Keywords

transducerMealy machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amounts of nondeterminism in finite automata
• Economy of description for single-valued transducers
• The complexity of simple computer architectures
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Concise representations of regular languages by degree and probabilistic finite automata
• Properties of Finite and Pushdown Transducers
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• A note on finite-valued and finitely ambiguous transducers
• Relations between varieties of kolmogorov complexities
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

This page was built for publication: Transforming a single-valued transducer into a Mealy machine