Two decidability problems for infinite words
From MaRDI portal
Recommendations
- Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular \(\omega\)-language
- scientific article; zbMATH DE number 5074397
- scientific article; zbMATH DE number 2051181
- scientific article; zbMATH DE number 1339972
- Decidability of the binary infinite Post Correspondence Problem
Cites work
Cited in
(15)- Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular \(\omega\)-language
- The two-cardinal problem for languages of arbitrary cardinality
- How to decide continuity of rational functions on infinite words
- On computability of data word functions defined by transducers
- Determinization of transducers over finite and infinite words.
- Automata, Borel functions and real numbers in Pisot base
- scientific article; zbMATH DE number 3940748 (Why is no real title available?)
- Uniformisations of regular relations over bi-infinite words
- The exact complexity of the infinite Post Correspondence Problem
- scientific article; zbMATH DE number 2087233 (Why is no real title available?)
- scientific article; zbMATH DE number 7561335 (Why is no real title available?)
- ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS
- Two Effective Properties of ω-Rational Functions
- THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS
- Infinite trees and automaton-definable relations over \(\omega\)-words
This page was built for publication: Two decidability problems for infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072715)
