Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
Recognizable picture languages and domino tiling
Theoretical Computer Science
Handbook of formal languages, vol. 3
Recognizability of rectangular pictures by Wang systems
Journal of Automata, Languages and Combinatorics
Automata, Languages, and Machines
Automata, Languages, and Machines
A Characterization of Recognizable Picture Languages
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Regular Expressions and Context-Free Grammars for Picture Languages
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
On Piecewise Testable, Starfree, and Recognizable Picture Languages
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Tile rewriting grammars and picture languages
Theoretical Computer Science - The art of theory
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Theoretical Computer Science
Snake-Deterministic Tiling Systems
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
A computational model for tiling recognizable two-dimensional languages
Theoretical Computer Science
Automata on a 2-dimensional tape
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Picture Recognizability with Automata Based on Wang Tiles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
| Hi-index | 0.04 |
Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and this implies that it is intrinsically non-deterministic. As result, all subclasses corresponding to different notion of unambiguity and determinism define a hierarchy inside REC. Moreover we show that some definitions of unambiguity are equivalent to corresponding notions of determinism and therefore correspond decidable classes closed under complementation and linear parsing algorithms.