Rational series and their languages
Rational series and their languages
On the degree of ambiguity of finite automata
Theoretical Computer Science
Finite-valued distance automata
Selected papers of the second international colloquium on Words, languages and combinatorics
Economy of description for single-valued transducers
Information and Computation
Theories of computability
A proof of Choffrut's theorem on subsequential functions
Theoretical Computer Science
Journal of the ACM (JACM)
On Fatou properties of rational languages
Where mathematics, computer science, linguistics and biology meet
Automata, Languages, and Machines
Automata, Languages, and Machines
Asymptotic behavior in a heap model with two pieces
Theoretical Computer Science
On the Determinization of Weighted Finite Automata
SIAM Journal on Computing
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
Minimizing subsequential transducers: a survey
Theoretical Computer Science
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Asymptotic Analysis of Heaps of Pieces and Application to Timed Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Efficient algorithms for testing the twins property
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Finite-state transducers in language and speech processing
Computational Linguistics
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Elements of Automata Theory
On the equivalence of Z-automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Conjugacy and equivalence of weighted automata and functional transducers
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Radix cross-sections for length morphisms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
This paper is a survey where we try to organise the known answers to the question whether a given finite automaton with multiplicity in a semiring K is equivalent to a sequential, or input deterministic, one. We shall see that depending on K, the question goes from obvious to open, that the answer goes from yes to undecidable. We review results on sequentiality in the cases of series of finite image, of series with multiplicity in fields, and of series with multiplicity in idempotent semirings.