Probabilistic length-reducing two-pushdown automata (Q841617): Difference between revisions

@@ Property / cites work @@
+Growing context-sensitive languages and Church-Rosser languages
+Normal rank
@@ Property / cites work @@
+Q4449165
@@ Property / cites work: Q4449165 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of Las Vegas II: Two-way finite automata
+Normal rank
@@ Property / cites work @@
+Membership for growing context-sensitive grammars is polynomial
+Normal rank
@@ Property / cites work @@
+Lower bound technique for length-reducing automata
+Normal rank
@@ Property / cites work @@
+Probabilistic Length-Reducing Automata
@@ Property / cites work: Probabilistic Length-Reducing Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of probabilistic pushdown automata
@@ Property / cites work: Properties of probabilistic pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941161
@@ Property / cites work: Q4941161 / rank @@
+Normal rank
@@ Property / cites work @@
+Church-Rosser Thue systems and formal languages
@@ Property / cites work: Church-Rosser Thue systems and formal languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737920
@@ Property / cites work: Q4737920 / rank @@
+Normal rank
@@ Property / cites work @@
+The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
+Normal rank
@@ Property / cites work @@
+Q4418659
@@ Property / cites work: Q4418659 / rank @@
+Normal rank