Two-Way Automata over Locally Finite Semirings

Louis-Marie Dando (1) , Sylvain Lombardy (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Two-way transducers or weighted automata are in general more powerful than one-way ones. We show that two-way automata over locally finite semirings may have undefined behaviour. We prove that it is decidable whether this behaviour is defined, and, if it is, we show that two-way automata over locally finite semirings are equivalent to one-way automata.

Mots clés: Two-way automata; Finite semirings

Domaines: Théorie et langage formel [cs.FL]; Mathématique discrète [cs.DM]

Louis-Marie Dando, Sylvain Lombardy. Two-Way Automata over Locally Finite Semirings. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Hallifax, NS, Canada. pp.62-74, ⟨10.1007/978-3-319-94631-3_6⟩. ⟨hal-01866160⟩