Abstract
In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance automata. In the second part of the paper we show that, with general min-plus semirings, it is decidable whether every accepted word has a weight different from -∞ and that, in contrast, it is undecidable whether there exists a word accepted with a weight different from -∞. © 2014 IFIP International Federation for Information Processing.
Cite
CITATION STYLE
Carnino, V., & Lombardy, S. (2014). Tropical two-way automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8705 LNCS, pp. 195–206). Springer Verlag. https://doi.org/10.1007/978-3-662-44602-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
