Sequential ?

Sylvain Lombardy (1) , Jacques Sakarovitch (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LTCI - Laboratoire Traitement et Communication de l'Information

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.

Mots clés: Finite automata; Sequential machine; Twinnig property

Domaines: Mathématique discrète [cs.DM]

Sylvain Lombardy, Jacques Sakarovitch. Sequential ?. Theoretical Computer Science, 2006, 356, pp.224 -- 244. ⟨10.1016/j.tcs.2006.01.028⟩. ⟨hal-00069863⟩