State Complexity of Nested Word Automata (Q3618567): Difference between revisions

@@ Property / cites work @@
+Marrying Words and Trees
@@ Property / cites work: Marrying Words and Trees / rank @@
+Normal rank
@@ Property / cites work @@
+First-Order and Temporal Logics for Nested Words
@@ Property / cites work: First-Order and Temporal Logics for Nested Words / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / 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 @@
+Minimizing Variants of Visibly Pushdown Automata
@@ Property / cites work: Minimizing Variants of Visibly Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the transition complexity of NFAs
+Normal rank
@@ Property / cites work @@
+Transition complexity of language operations
@@ Property / cites work: Transition complexity of language operations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3505886
@@ Property / cites work: Q3505886 / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming tree automata
@@ Property / cites work: Streaming tree automata / rank @@
+Normal rank
@@ Property / cites work @@
+General varieties of tree languages
@@ Property / cites work: General varieties of tree languages / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Q5422234
@@ Property / cites work: Q5422234 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Lower Bounds for Nondeterministic State Complexity Is Hard
+Normal rank
@@ Property / cites work @@
+Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
+Normal rank
@@ Property / cites work @@
+Nondeterministic state complexity of nested word automata
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+Q4465337
@@ Property / cites work: Q4465337 / rank @@
+Normal rank
@@ Property / cites work @@
+State complexity of some operations on binary regular languages
+Normal rank
@@ Property / cites work @@
+Minimization, Learning, and Conformance Testing of Boolean Programs
+Normal rank
@@ Property / cites work @@
+Operational state complexity of nested word automata
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
+Normal rank
@@ Property / cites work @@
+Q4681320
@@ Property / cites work: Q4681320 / rank @@
+Normal rank