Quasi-rocking real-time pushdown automata (Q650904): Difference between revisions

@@ Property / cites work @@
+Quasi-realtime languages
@@ Property / cites work: Quasi-realtime languages / rank @@
+Normal rank
@@ Property / cites work @@
+An elementary proof of double Greibach normal form
+Normal rank
@@ Property / cites work @@
+Context-free graph languages of bounded degree are generated by apex graph grammars
+Normal rank
@@ Property / cites work @@
+Apex graph grammars and attribute grammars
@@ Property / cites work: Apex graph grammars and attribute grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary graph grammars with dynamic edge relabeling
+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 @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy of eNCE families of graph languages
@@ Property / cites work: A hierarchy of eNCE families of graph languages / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient recognition algorithms for boundary and linear eNCE graph languages
+Normal rank
@@ Property / cites work @@
+Double Greibach operator grammars
@@ Property / cites work: Double Greibach operator grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Node replacement graph languages squeezed with chains, trees, and forests
+Normal rank
@@ Property / cites work @@
+Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
+Normal rank
@@ Property / cites work @@
+Q3741057
@@ Property / cites work: Q3741057 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? decidability results from complete formal systems
+Normal rank
@@ Property / cites work @@
+Turn-bounded grammars and their relation to ultralinear languages
+Normal rank