Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-22600-7_20
+Normal rank
@@ Property / OpenAlex ID @@
+W2179624438
@@ Property / OpenAlex ID: W2179624438 / rank @@
+Normal rank
@@ Property / cites work @@
+Reversal-bounded multipushdown machines
@@ Property / cites work: Reversal-bounded multipushdown machines / rank @@
+Normal rank
@@ Property / cites work @@
+More concise representation of regular languages by automata and regular expressions
+Normal rank
@@ Property / cites work @@
+Q5422234
@@ Property / cites work: Q5422234 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the equivalence problem for two characterizations of Presburger sets
+Normal rank
@@ Property / cites work @@
+On the Succinctness of Different Representations of Languages
+Normal rank
@@ Property / cites work @@
+Q3102144
@@ Property / cites work: Q3102144 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Regular(-Like) Expressions
@@ Property / cites work: The Complexity of Regular(-Like) Expressions / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of multi-head finite automata: origins and directions
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on semilinear sets and bounded-reversal multihead pushdown automata
+Normal rank
@@ Property / cites work @@
+New Decidability Results Concerning Two-Way Counter Machines
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Q4465339
@@ Property / cites work: Q4465339 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3517107
@@ Property / cites work: Q3517107 / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptional Complexity of Bounded Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Q4239067
@@ Property / cites work: Q4239067 / 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 @@
+Regularity and Related Problems for Deterministic Pushdown Automata
+Normal rank
@@ Property / cites work @@
+A note on the succinctness of descriptions of deterministic languages
+Normal rank