Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426): Difference between revisions

@@ Property / cites work @@
+Decidable Properties of Monadic Functional Schemas
+Normal rank
@@ Property / cites work @@
+Q5526125
@@ Property / cites work: Q5526125 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146243
@@ Property / cites work: Q4146243 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic context free languages
@@ Property / cites work: Deterministic context free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Strict deterministic grammars
@@ Property / cites work: Strict deterministic grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q4072875
@@ Property / cites work: Q4072875 / rank @@
+Normal rank
@@ Property / cites work @@
+Real-Time Definable Languages
@@ Property / cites work: Real-Time Definable Languages / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(77)80019-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2009721064
@@ Property / OpenAlex ID: W2009721064 / rank @@
+Normal rank