DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the length of word chains
@@ Property / cites work: Tight lower bounds on the length of word chains / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating finite automata with context-free grammars.
+Normal rank
@@ Property / cites work @@
+Mappings which preserve context sensitive languages
+Normal rank
@@ Property / cites work @@
+A pushdown automaton or a context-free grammar - which is more economical?
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+On the translation of languages from left to right
+Normal rank
@@ Property / cites work @@
+Optimal Simulations between Unary Automata
@@ Property / cites work: Optimal Simulations between Unary Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:3395134