Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Theoretical Computer Science
A computational model for tiling recognizable two-dimensional languages
Theoretical Computer Science
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Tiling automaton: a computational model for recognizable two-dimensional languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
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
Deterministic two-dimensional languages over one-letter alphabet
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
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
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Towards more expressive 2D deterministic automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Regular expressions for two-dimensional languages over one-letter alphabet
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
Fundamenta Informaticae
Hi-index | 0.00 |