Recognizable picture languages and domino tiling
Theoretical Computer Science
Handbook of formal languages, vol. 3
Context-sensitive string languages and recognizable picture languages
Information and Computation
On Some Recognizable Picture-Languages
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
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
Towards Optimal Locality in Mesh-Indexings
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The tight deterministic time hierarchy
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A tiling system for the class of L-convex polyominoes
Theoretical Computer Science
| Hi-index | 0.00 |
We show that the language of pictures over {a,b} (with a reasonable relation between height and width), where the number of a's is equal to the number of b's, is recognizable using a finite tiling system. This means that counting in rectangular arrays is definable in existential monadic second-order logic.