On the representation of finite deterministic 2-tape automata

DOI10.1016/S0304-3975(98)00179-0zbMath0930.68075OpenAlexW2070213299MaRDI QIDQ1960654

Jacques Sakarovitch, Maryse Pelletier

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00179-0

zbMATH Keywords

uniformization theoremdeterministic rational relationsdeterministic \(k\)-tape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Lexicographic decomposition of \(k\)-valued transducers ⋮ An Automata Theoretic Approach to Rational Tree Relations ⋮ Subsemigroups of groups: presentations, Malcev presentations, and automatic structures ⋮ Modelization of deterministic rational relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• The equivalence problem of multitape finite automata
• Topology of finite graphs
• Rational equivalence relations
• Sur les rélations rationnelles entre monoides libres
• Sur une variante des fonctions séquentielles
• A construction on finite automata that has remained hidden
• Multitape one-way nonwriting automata
• On Relations Defined by Generalized Finite Automata

This page was built for publication: On the representation of finite deterministic 2-tape automata