Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-31644-9_13
+Normal rank
@@ Property / OpenAlex ID @@
+W3756466
@@ Property / OpenAlex ID: W3756466 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Visibly pushdown languages
@@ Property / cites work: Visibly pushdown languages / rank @@
+Normal rank
@@ Property / cites work @@
+Adding nesting structure to words
@@ Property / cites work: Adding nesting structure to words / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
+Normal rank
@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+On the Expressive Power of 2-Stack Visibly Pushdown Automata
+Normal rank
@@ Property / cites work @@
+Q3341935
@@ Property / cites work: Q3341935 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219133
@@ Property / cites work: Q3219133 / rank @@
+Normal rank
@@ Property / cites work @@
+-Visibly Pushdown Automata
@@ Property / cites work: 2-Visibly Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Variants of Visibly Pushdown Automata
@@ Property / cites work: Minimizing Variants of Visibly Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3505883
@@ Property / cites work: Q3505883 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating finite automata with context-free grammars.
+Normal rank
@@ Property / cites work @@
+Tree transducers, L systems, and two-way machines
@@ Property / cites work: Tree transducers, L systems, and two-way machines / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming tree automata
@@ Property / cites work: Streaming tree automata / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Nondeterministic state complexity of nested word automata
+Normal rank
@@ Property / cites work @@
+On the Succinctness of Different Representations of Languages
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
+Normal rank
@@ Property / cites work @@
+Descriptional and computational complexity of finite automata -- a survey
+Normal rank
@@ Property / cites work @@
+On the State Complexity of Operations on Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Parallel and two-way automata on directed ordered acyclic graphs
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
+Normal rank
@@ Property / cites work @@
+State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
+Normal rank
@@ Property / cites work @@
+The tree width of auxiliary storage
@@ Property / cites work: The tree width of auxiliary storage / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628039
@@ Property / cites work: Q5628039 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3890112
@@ Property / cites work: Q3890112 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Simulations between Unary Automata
@@ Property / cites work: Optimal Simulations between Unary Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Height-Deterministic Pushdown Automata
@@ Property / cites work: Height-Deterministic Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Unambiguous Finite Automata over a Unary Alphabet
@@ Property / cites work: Unambiguous Finite Automata over a Unary Alphabet / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Descriptional Complexity of Unambiguous Nested Word Automata
+Normal rank
@@ Property / cites work @@
+State Complexity of Operations on Input-Driven Pushdown Automata
+Normal rank
@@ Property / cites work @@
+Operational state complexity of nested word automata
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages
+Normal rank
@@ Property / cites work @@
+Limitations of lower bound methods for deterministic nested word automata
+Normal rank
@@ Property / cites work @@
+A Second Course in Formal Languages and Automata Theory
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank