Handbook of formal languages, vol. 3
A characterization of recognizable picture languages by tilings by finite sets
Theoretical Computer Science - Special issue on Caen '97
Picture Languages: Formal Models for Picture Recognition
Picture Languages: Formal Models for Picture Recognition
Regular Expressions and Context-Free Grammars for Picture Languages
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
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
Collage of two-dimensional words
Theoretical Computer Science - The art of theory
Finite automata and non-self-embedding grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
A SAT-based parser and completer for pictures specified by tiling
Pattern Recognition
Results on Hexagonal Tile Rewriting Grammars
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Picture Languages Generated by Assembling Tiles
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Picture Languages: From Wang Tiles to 2D Grammars
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
On some classes of 2D languages and their relations
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Generalized gandy-păun-rozenberg machines for tile systems and cellular automata
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Picture Languages Generated by Assembling Tiles
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Hi-index | 0.00 |
Two formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling systems and tile rewriting grammars, which resp. extend to 2D the regular and context-free languages. Two results extending classical language properties into 2D are proved. First, non-recursive tile writing grammars (TRG) coincide with tiling systems (TS). Second, non-self-embedding TRG are suitably defined as corner grammars, showing that they generate TS languages. The proofs exploit newly introduced language substitutions, also nested and iterated.