Two-Way Automata over Locally Finite Semirings
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.
- 5.Lombardy, S.: Weighted two-way automata. In: NCMA 2015. firstname.lastname@example.org, vol. 318, pp. 37–47. Österreichische Computer Gesellschaft (2015)Google Scholar