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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 21; číslo 3; s. 1 - 32
Hlavní autori:	Loding, Christof, Spinrath, Christopher
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.07.2019
Predmet:	Algorithms Decision theory Machine theory Mathematical research Polynomials Germany
ISSN:	1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!