Handbook of formal languages, vol. 3
Recognizability of rectangular pictures by Wang systems
Journal of Automata, Languages and Combinatorics
A characterization of recognizable picture languages by tilings by finite sets
Theoretical Computer Science - Special issue on Caen '97
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Tile rewriting grammars and picture languages
Theoretical Computer Science - The art of theory
New operations and regular expressions for two-dimensional languages over one-letter alphabet
Theoretical Computer Science - The art of 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
Regional Languages and Tiling: A Unifying Approach to Picture Grammars
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the complexity of unary tiling-recognizable picture languages
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Deterministic two-dimensional languages over one-letter alphabet
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Hi-index | 0.00 |
We propose a new formalism for generating picture languages based on an assembly mechanism of tiles that uses rules having a context and a replacement site. More precisely, a picture language will be generated from a finite set of initial pictures by iteratively applying rewriting rules from a given finite set of rules, called a tiling rule system (TRuS system). We prove that the TRuS systems have a greater generative capacity than the tiling systems of Giammarresi and Restivo. This is due mainly to the use of the notion of replacement site, but we further characterize the difference between these systems by comparing them to Wang systems.