Handbook of formal languages, vol. 3
Bounded Parallelism in Array Grammars Used for Character Recognition
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern 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
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Picture languages: tiling systems versus tile rewriting grammars
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Characterizations of recognizable picture series
Theoretical Computer Science
A CKY parser for picture grammars
Information Processing Letters
Regional Languages and Tiling: A Unifying Approach to Picture Grammars
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Picture Languages: From Wang Tiles to 2D Grammars
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
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
A brief excursion inside the class of tiling recognizable two-dimensional languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On some classes of 2D languages and their relations
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Classification of string languages via tiling recognizable picture languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Picture Languages Generated by Assembling Tiles
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Validating the semantics of a medical iconic language using ontological reasoning
Journal of Biomedical Informatics
| Hi-index | 0.00 |
Tile rewriting grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into an isometric one tiled with specified tiles. Derivation and language generation with TRG rules are similar to context-free grammars. A normal form and some closure properties are presented. We prove this model has greater generative capacity than the tiling systems of Giammarresi and Restivo and the grammars of Matz, another generalization of context-free string grammars to 2D. Examples are shown for pictures made by nested frames and spirals.