%0 Conference Proceedings
%T Two-Way Automata over Locally Finite Semirings
%+ Laboratoire Bordelais de Recherche en Informatique (LaBRI)
%A Dando, Louis-Marie
%A Lombardy, Sylvain
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 20th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Hallifax, NS, Canada
%Y Stavros Konstantinidis
%Y Giovanni Pighizzini
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10952
%P 62-74
%8 2018-07-25
%D 2018
%R 10.1007/978-3-319-94631-3_6
%K Two-way automata
%K Finite semirings
%Z Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
%Z Computer Science [cs]/Discrete Mathematics [cs.DM]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://hal.science/hal-01866160/document
%2 https://hal.science/hal-01866160/file/470153_1_En_6_Chapter.pdf
%L hal-01866160
%U https://hal.science/hal-01866160
%~ CNRS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ TDS-MACS
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10952
%~ TEST-HALCNRS