ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559): Difference between revisions

@@ Property / cites work @@
+On Goedel speed-up and succinctness of language representations
+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 @@
+WHEN CHURCH-ROSSER BECOMES CONTEXT FREE
@@ Property / cites work: WHEN CHURCH-ROSSER BECOMES CONTEXT FREE / rank @@
+Normal rank
@@ Property / cites work @@
+ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
+Normal rank
@@ Property / cites work @@
+On stateless deterministic restarting automata
@@ Property / cites work: On stateless deterministic restarting automata / rank @@
+Normal rank
@@ Property / cites work @@
+OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
@@ Property / cites work: OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct description of regular languages by weak restarting automata
+Normal rank
@@ Property / cites work @@
+Complexity of certain decision problems about congruential languages
+Normal rank
@@ Property / cites work @@
+Recursive Unsolvability of a problem of Thue
@@ Property / cites work: Recursive Unsolvability of a problem of Thue / rank @@
+Normal rank
@@ Property / cites work @@
+A regularity test for pushdown machines
@@ Property / cites work: A regularity test for pushdown machines / rank @@
+Normal rank
@@ Property / cites work @@
+Regularity and Related Problems for Deterministic Pushdown Automata
+Normal rank