Succinct description of regular languages by weak restarting automata (Q948085): Difference between revisions

@@ Property / cites work @@
+Size/lookahead tradeoff for \(LL(k)\)-grammars
@@ Property / cites work: Size/lookahead tradeoff for \(LL(k)\)-grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+State-complexity of finite-state devices, state compressibility and incompressibility
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Restarting automata
@@ Property / cites work: Restarting automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4934755
@@ Property / cites work: Q4934755 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+State complexity of some operations on binary regular languages
+Normal rank
@@ Property / cites work @@
+THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
@@ Property / cites work: THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of parsers and \(\text{LR}(k)\)-grammars
+Normal rank
@@ Property / cites work @@
+Q4531378
@@ Property / cites work: Q4531378 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708956
@@ Property / cites work: Q2708956 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452052
@@ Property / cites work: Q4452052 / rank @@
+Normal rank
@@ Property / cites work @@
+Recent advances in formal languages and applications.
+Normal rank
@@ Property / cites work @@
+Q4390537
@@ Property / cites work: Q4390537 / rank @@
+Normal rank