On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1837373388
@@ Property / OpenAlex ID: W1837373388 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0690
@@ Property / arXiv ID: 1406.0690 / rank @@
+Normal rank
@@ Property / cites work @@
+Using forward reachability analysis for verification of lossy channel systems
+Normal rank
@@ Property / cites work @@
+Q3774976
@@ Property / cites work: Q3774976 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
+Normal rank
@@ Property / cites work @@
+Searching subsequences
@@ Property / cites work: Searching subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Computable fixpoints in well-structured symbolic model checking
+Normal rank
@@ Property / cites work @@
+Q5178448
@@ Property / cites work: Q5178448 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
+Normal rank
@@ Property / cites work @@
+Quotient complexity of ideal languages
@@ Property / cites work: Quotient complexity of ideal languages / rank @@
+Normal rank
@@ Property / cites work @@
+Decision problems for convex languages
@@ Property / cites work: Decision problems for convex languages / rank @@
+Normal rank
@@ Property / cites work @@
+Unambiguity in Automata Theory
@@ Property / cites work: Unambiguity in Automata Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5639639
@@ Property / cites work: Q5639639 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4713368
@@ Property / cites work: Q4713368 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for subsequence combinatorics
@@ Property / cites work: Algorithms for subsequence combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+An Algebraic Characterization of Strictly Piecewise Languages
+Normal rank
@@ Property / cites work @@
+Finding Lower Bounds for Nondeterministic State Complexity Is Hard
+Normal rank
@@ Property / cites work @@
+The size of Higman-Haines sets
@@ Property / cites work: The size of Higman-Haines sets / rank @@
+Normal rank
@@ Property / cites work @@
+More on the Size of Higman-Haines Sets: Effective Constructions
+Normal rank
@@ Property / cites work @@
+The Power of Priority Channel Systems
@@ Property / cites work: The Power of Priority Channel Systems / rank @@
+Normal rank
@@ Property / cites work @@
+The Downward-Closure of Petri Net Languages
@@ Property / cites work: The Downward-Closure of Petri Net Languages / rank @@
+Normal rank
@@ Property / cites work @@
+On free monoids partially ordered by embedding
@@ Property / cites work: On free monoids partially ordered by embedding / rank @@
+Normal rank
@@ Property / cites work @@
+On Shuffle Ideals
@@ Property / cites work: On Shuffle Ideals / rank @@
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+An Evaluation of Automata Algorithms for String Analysis
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Shuffle and scattered deletion closure of languages
+Normal rank
@@ Property / cites work @@
+Entropy, independent sets and antichains: A new approach to Dedekind’s problem
+Normal rank
@@ Property / cites work @@
+On NFAs where all states are final, initial, or both
+Normal rank
@@ Property / cites work @@
+Q5278312
@@ Property / cites work: Q5278312 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263694
@@ Property / cites work: Q4263694 / rank @@
+Normal rank
@@ Property / cites work @@
+On Dedekind's Problem: The Number of Monotone Boolean Functions
+Normal rank
@@ Property / cites work @@
+Effective constructions in well-partially-ordered free monoids
+Normal rank
@@ Property / cites work @@
+Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
+Normal rank
@@ Property / cites work @@
+DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
+Normal rank
@@ Property / cites work @@
+Q3086930
@@ Property / cites work: Q3086930 / rank @@
+Normal rank
@@ Property / cites work @@
+On the State Complexity of Scattered Substrings and Superstrings
+Normal rank
@@ Property / cites work @@
+Marcus contextual grammars
@@ Property / cites work: Marcus contextual grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial closure and unambiguous product
@@ Property / cites work: Polynomial closure and unambiguous product / rank @@
+Normal rank
@@ Property / cites work @@
+Q2893312
@@ Property / cites work: Q2893312 / rank @@
+Normal rank
@@ Property / cites work @@
+On Languages Piecewise Testable in the Strict Sense
+Normal rank
@@ Property / cites work @@
+State complexity of combined operations
@@ Property / cites work: State complexity of combined operations / rank @@
+Normal rank
@@ Property / cites work @@
+The size of subsequence automaton
@@ Property / cites work: The size of subsequence automaton / rank @@
+Normal rank
@@ Property / cites work @@
+Q4681320
@@ Property / cites work: Q4681320 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Downward Closures for Stacked Counter Automata
+Normal rank