Finite automata and unary languages
Theoretical Computer Science
Handbook of formal languages, vol. 3
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical 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
New operations and regular expressions for two-dimensional languages over one-letter alphabet
Theoretical Computer Science - The art of theory
Framed Versus Unframed Two-Dimensional Languages
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Theoretical 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
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic two-dimensional languages over one-letter alphabet
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
| Hi-index | 0.00 |
The paper deals with some open questions related to unambiguity, finite ambiguity and complementation of two-dimensional recognizable languages. We give partial answers based on the introduction of special classes of languages of "high complexity", in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. In the last part of the paper we also show a new necessary condition for recognizable two-dimensional languages on unary alphabet.