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

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

Latest revision as of 05:21, 11 July 2024

scientific article
Language Label Description Also known as
English
On the state complexity of closures and interiors of regular languages with subwords and superwords
scientific article

    Statements

    On the state complexity of closures and interiors of regular languages with subwords and superwords (English)
    0 references
    10 December 2015
    0 references
    0 references
    finite automata and regular languages
    0 references
    subwords and superwords
    0 references
    state complexity
    0 references
    combined operations
    0 references
    closures and interiors of regular languages
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references