Tropical Two-Way Automata - Theoretical Computer Science Access content directly
Conference Papers Year : 2014

Tropical Two-Way Automata

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 finite weight and that, in contrast, it is undecidable whether there exists a word accepted with a finite weight.
Fichier principal
Vignette du fichier
minplus-pub.pdf (333.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01069637 , version 1 (16-06-2016)

Licence

Attribution

Identifiers

Cite

Vincent Carnino, Sylvain Lombardy. Tropical Two-Way Automata. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.195-206, ⟨10.1007/978-3-662-44602-7_16⟩. ⟨hal-01069637⟩
394 View
164 Download

Altmetric

Share

Gmail Facebook X LinkedIn More