Intersection and union of regular languages and state complexity
Information Processing Letters
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 3
Recognizability of rectangular pictures by Wang systems
Journal of Automata, Languages and Combinatorics
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
A Characterization of Recognizable Picture Languages
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
On Piecewise Testable, Starfree, and Recognizable Picture Languages
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
Tile rewriting grammars and picture languages
Theoretical Computer Science - The art of theory
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
Picture Recognizability with Automata Based on Wang Tiles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
The main problem in this paper is to find feasible conditions to prove/disprove that a given two-dimensional language is tiling recognizable. We focus on two known conditions necessarily satisfied by a recognizable language, that are based on the idea to reduce the problem from picture to string languages. We emphasize that they are grounded on two lower bound techniques for regular string languages. Starting from a stronger lower bound, named the nondeterministic message complexity technique, we are able to state a new necessary condition for the recognizability of two-dimensional languages. We compare the three conditions and find that the new one extends the previous two yielding a greater accuracy.