Deterministic finite automata with recursive calls and DPDAs (Q1014418): Difference between revisions

@@ Property / cites work @@
+Q4551151
@@ Property / cites work: Q4551151 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535054
@@ Property / cites work: Q4535054 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529998
@@ Property / cites work: Q4529998 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs, II: Infinite graphs of bounded width
+Normal rank
@@ Property / cites work @@
+DPDA's in 'Atomic normal form' and applications to equivalence problems
+Normal rank
@@ Property / cites work @@
+Statecharts: a visual formalism for complex systems
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Strict deterministic grammars
@@ Property / cites work: Strict deterministic grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588671
@@ Property / cites work: Q5588671 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4116078
@@ Property / cites work: Q4116078 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic pushdown automata is decidable
+Normal rank
@@ Property / cites work @@
+Q4529994
@@ Property / cites work: Q4529994 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of DPDA equivalence
@@ Property / cites work: Decidability of DPDA equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+Transition network grammars for natural language analysis
+Normal rank