Simple context-free languages and free monadic recursion schemes (Q4139703): Difference between revisions

@@ Property / cites work @@
+Decidable Properties of Monadic Functional Schemas
+Normal rank
@@ Property / cites work @@
+Equivalence problems for deterministic context-free languages and monadic recursion schemes
+Normal rank
@@ Property / cites work @@
+Program schemes, recursion schemes, and formal languages
+Normal rank
@@ Property / cites work @@
+Deterministic context free languages
@@ Property / cites work: Deterministic context free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-Turn Pushdown Automata
@@ Property / cites work: Finite-Turn Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Strict deterministic grammars
@@ Property / cites work: Strict deterministic grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of deterministic top-down grammars
@@ Property / cites work: Properties of deterministic top-down grammars / 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
@@ Property / cites work @@
+Deterministic one-counter automata
@@ Property / cites work: Deterministic one-counter automata / rank @@
+Normal rank