Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical Computer Science
The #a = #b Pictures Are Recognizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Perfectly quilted rectangular snake tilings
Theoretical Computer Science
Formal language characterizations of P, NP, and Pspace
Journal of Automata, Languages and Combinatorics
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Tiling recognizable two-dimensional languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Recognizable vs. regular picture languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Recognizable picture languages and polyominoes
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
A survey on picture-walking automata
Algebraic Foundations in Computer Science
A tiling system for the class of L-convex polyominoes
Theoretical Computer Science
Hi-index | 0.00 |