Decision Problems for Recognizable Languages of Infinite Pictures
From MaRDI portal
Publication:3172126
zbMath1244.03052arXiv1107.5896MaRDI QIDQ3172126
Publication date: 5 October 2011
Full work available at URL: https://arxiv.org/abs/1107.5896
decision problemanalytical hierarchymodels of set theorycardinality problemindependence from ZFChighly undecidable problemslanguages of infinite picturesrecognizability by tiling systemsunambiguity problem
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) Consistency and independence results (03E35)
Related Items (1)
This page was built for publication: Decision Problems for Recognizable Languages of Infinite Pictures