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

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 21; no. 3; pp. 1 - 32
Main Authors:	Loding, Christof, Spinrath, Christopher
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.07.2019
Subjects:	Algorithms Decision theory Machine theory Mathematical research Polynomials Germany
ISSN:	1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!