A construction on finite automata that has remained hidden

DOI10.1016/S0304-3975(98)00040-1zbMath0913.68137MaRDI QIDQ1275469

Jacques Sakarovitch

Publication date: 12 January 1999

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

zbMATH Keywords

finite automatarational relationscross-section theoremfinite transducersunambiguous functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A Disambiguation Algorithm for Finite Automata and Functional Transducers, Lexicographic decomposition of \(k\)-valued transducers, On the representation of finite deterministic 2-tape automata, On the Decidability of the Equivalence for k-Valued Transducers, Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers., ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, How expressions can code for automata, Unnamed Item, Series which are both max-plus and min-plus rational are unambiguous, Finite sequentiality of unambiguous max-plus tree automata, On the Decidability of the Equivalence for a Certain Class of Transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Topology of finite graphs
• Sur les rélations rationnelles entre monoides libres
• Sur une variante des fonctions séquentielles
• A new proof of two theorems about rational transductions
• Fibonacci representations and finite automata
• On a Theorem of R. Jungen
• On Relations Defined by Generalized Finite Automata
• Classification of formal languages by functional binary transductions
• A remark on finite transducers