A construction on finite automata that has remained hidden
From MaRDI portal
Publication:1275469
DOI10.1016/S0304-3975(98)00040-1zbMATH Open0913.68137MaRDI QIDQ1275469FDOQ1275469
Authors: Jacques Sakarovitch 
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4037202
- scientific article; zbMATH DE number 1941938
- On an algorithm of constructing Conway's universal automaton
- Constructions for alternating finite automata∗
- Construction of universal finite automata. I: From theorem to the practical algorithms
- scientific article; zbMATH DE number 1538036
- scientific article; zbMATH DE number 1929974
- scientific article; zbMATH DE number 1234586
- On finite automata with limited nondeterminism (extended abstract)
- Automata with finite congruence lattices
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Relations Defined by Generalized Finite Automata
- Topology of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fibonacci representations and finite automata
- Sur une variante des fonctions séquentielles
- On a Theorem of R. Jungen
- Synchronized rational relations of finite and infinite words
- Title not available (Why is that?)
- Sur les rélations rationnelles entre monoides libres
- A new proof of two theorems about rational transductions
- Classification of formal languages by functional binary transductions
- A remark on finite transducers
Cited In (17)
- On the Decidability of the Equivalence for a Certain Class of Transducers
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How expressions can code for automata
- Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers.
- A disambiguation algorithm for finite automata and functional transducers
- Lexicographic decomposition of \(k\)-valued transducers
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Finite sequentiality of unambiguous max-plus tree automata
- On the representation of finite deterministic 2-tape automata
- Series which are both max-plus and min-plus rational are unambiguous
- On the Decidability of the Equivalence for k-Valued Transducers
- Some more on the basis finite automaton
- Yet another proof of the cascade decomposition theorem for finite automata: Correction
This page was built for publication: A construction on finite automata that has remained hidden
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275469)
