ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES
From MaRDI portal
Publication:4652792
DOI10.1142/S0129054104002777zbMath1137.03319MaRDI QIDQ4652792
Publication date: 28 February 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
decision problemstopological complexitytiling systemslanguages of infinite picturesA-recognizableautomata reading ordinal words of length \(\omega^2\)Borel and analytic setsE-recognizable
Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)
Related Items
Cites Work
- Unnamed Item
- Descriptive set theory
- Theories of automata on \(\omega\)-tapes: a simplified approach
- The monadic second order theory of all countable ordinals
- \(\omega\)-computations on Turing machines
- Finite automata and ordinals
- Weak Second‐Order Arithmetic and Finite Automata
- On the Topological Complexity of Infinitary Rational Relations
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
- Decision problems forω-automata
- Locally finite languages
- Computer science and the fine structure of Borel sets
