A construction on finite automata that has remained hidden
From MaRDI portal
(Redirected from Publication:1275469)
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
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3351454 (Why is no real title available?)
- A new proof of two theorems about rational transductions
- A remark on finite transducers
- Classification of formal languages by functional binary transductions
- Fibonacci representations and finite automata
- On Relations Defined by Generalized Finite Automata
- On a Theorem of R. Jungen
- Sur les rélations rationnelles entre monoides libres
- Sur une variante des fonctions séquentielles
- Synchronized rational relations of finite and infinite words
- Topology of finite graphs
Cited in
(17)- On the Decidability of the Equivalence for a Certain Class of Transducers
- Yet another proof of the cascade decomposition theorem for finite automata: Correction
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- scientific article; zbMATH DE number 1512773 (Why is no real title available?)
- scientific article; zbMATH DE number 7559164 (Why is no real title available?)
- scientific article; zbMATH DE number 4018394 (Why is no real title available?)
- 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
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)
