Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932): Difference between revisions

@@ Property / cites work @@
+Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
+Normal rank
@@ Property / cites work @@
+A computational model for tiling recognizable two-dimensional languages
+Normal rank
@@ Property / cites work @@
+Unambiguous recognizable two-dimensional languages
+Normal rank
@@ Property / cites work @@
+Deterministic and unambiguous two-dimensional languages over one-letter alphabet
+Normal rank
@@ Property / cites work @@
+Classes of two-dimensional languages and recognizability conditions
+Normal rank
@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+Q3431476
@@ Property / cites work: Q3431476 / rank @@
+Normal rank
@@ Property / cites work @@
+Tile rewriting grammars and picture languages
@@ Property / cites work: Tile rewriting grammars and picture languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4209252
@@ Property / cites work: Q4209252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086926
@@ Property / cites work: Q3086926 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second-order logic over rectangular pictures and recognizability by tiling systems
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Finding Lower Bounds for Nondeterministic State Complexity Is Hard
+Normal rank
@@ Property / cites work @@
+Q4506483
@@ Property / cites work: Q4506483 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity method for measuring nondeterminism in finite automata
+Normal rank
@@ Property / cites work @@
+Picture Recognizability with Automata Based on Wang Tiles
+Normal rank
@@ Property / cites work @@
+The monadic quantifier alternation hierarchy over grids and graphs
+Normal rank