Two decidability problems for infinite words
From MaRDI portal
Publication:1072715
DOI10.1016/0020-0190(86)90058-XzbMath0587.68072MaRDI QIDQ1072715
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Post correspondence problem; emptiness problem; infinitary language; infinitary rational relation; omega-equality set
68Q45: Formal languages and automata
Related Items
THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE, Automata, Borel functions and real numbers in Pisot base, Infinite trees and automaton-definable relations over \(\omega\)-words, How to decide continuity of rational functions on infinite words, Determinization of transducers over finite and infinite words., The exact complexity of the infinite Post Correspondence Problem
Cites Work