State complexity of finite partial languages (Q6100188): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2023.114001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the state complexity of partial word DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Combinatorics on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal partial languages and automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cover-automata for finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maxmin problem on finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages of partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4590910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Partial Word Automata Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of partial word finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of finite partial languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2023.114001 / rank
 
Normal rank

Latest revision as of 18:27, 30 December 2024

scientific article; zbMATH DE number 7699969
Language Label Description Also known as
English
State complexity of finite partial languages
scientific article; zbMATH DE number 7699969

    Statements

    State complexity of finite partial languages (English)
    0 references
    0 references
    0 references
    21 June 2023
    0 references
    partial words
    0 references
    finite languages
    0 references
    deterministic finite automata
    0 references
    minimal automata
    0 references
    determinization
    0 references
    operational state complexity
    0 references
    hierarchies on the number of unknown symbol transitions
    0 references

    Identifiers