Pages that link to "Item:Q1072715"
From MaRDI portal
The following pages link to Two decidability problems for infinite words (Q1072715):
Displayed 6 items.
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- How to decide continuity of rational functions on infinite words (Q1589419) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
- THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE (Q4923292) (← links)
- Automata, Borel functions and real numbers in Pisot base (Q5444100) (← links)