A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata

We show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted finite automata over the tropical semiring which gives a partial answer to a question by Mohri [29]. The proof relies on an improvement of the notion of the twins property and a Burnside type char...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Informatique théorique et applications (Imprimé) 2008-07, Vol.42 (3), p.553-581
1. Verfasser:	Kirsten, Daniel
Format:	Artikel
Sprache:	eng
Schlagworte:	20M35 68Q45 68Q70 Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems determinization Exact sciences and technology Miscellaneous Theoretical computing tropical semiring Weighted automata
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted finite automata over the tropical semiring which gives a partial answer to a question by Mohri [29]. The proof relies on an improvement of the notion of the twins property and a Burnside type characterization for the finiteness of the set of states produced by Mohri's algorithm.
ISSN:	0988-3754 1290-385X
DOI:	10.1051/ita:2008017