Two-Way Automata over Locally Finite Semirings - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2018

Two-Way Automata over Locally Finite Semirings

Abstract

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.
Fichier principal
Vignette du fichier
470153_1_En_6_Chapter.pdf (171.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01866160 , version 1 (26-10-2018)

Licence

Attribution

Identifiers

Cite

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⟩
502 View
146 Download

Altmetric

Share

Gmail Facebook X LinkedIn More