Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words

We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Further...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Mathematics and Theoretical Computer Science Jg. 21; H. 3; S. 1 - 32
Hauptverfasser:	Loding, Christof, Spinrath, Christopher
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.07.2019
Schlagworte:	Algorithms Decision theory Machine theory Mathematical research Polynomials Germany
ISSN:	1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!