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

by Christof Löding RWTH Aachen University

Released as a article .

2018  

Abstract

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. Furthermore, we show that it is decidable in doubly exponential time for an automatic relation over infinite words whether it is a recognizable relation. We also revisit this problem in the context of finite words and improve the complexity of the decision procedure to single exponential time. The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest.
In text/plain format

Archived Files and Locations

application/pdf  418.2 kB
file_4t5nmnzldfadrnbjlyb3nrkzw4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-03-16
Version   v1
Language   en ?
arXiv  1803.06140v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 926a18d0-872b-4b94-8fcb-c1f71d54589c
API URL: JSON