Time and space complexity of inside-out macro languages (Q3922197): Difference between revisions

@@ Property / cites work @@
+Indexed Grammars—An Extension of Context-Free Grammars
+Normal rank
@@ Property / cites work @@
+Space-bounded complexity classes and iterated deterministic substitution
+Normal rank
@@ Property / cites work @@
+Extended linear macro grammars, iteration grammars, and register programs
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+IO and OI. I
@@ Property / cites work: IO and OI. I / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded nesting in macro grammars
@@ Property / cites work: Bounded nesting in macro grammars / rank @@
+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 complexity of finite, pushdown, and stack automata
+Normal rank
@@ Property / cites work @@
+Recognition of deterministic ETOL languages in logarithmic space
+Normal rank
@@ Property / cites work @@
+The complexity of the membership problem for some extensions of context-free languagest†
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank