On the state complexity of partial word DFAs (Q2344741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partial Word DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / 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: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Combinatorics on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3156941 / rank
 
Normal rank

Revision as of 01:52, 10 July 2024

scientific article
Language Label Description Also known as
English
On the state complexity of partial word DFAs
scientific article

    Statements

    On the state complexity of partial word DFAs (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2015
    0 references
    automata
    0 references
    formal languages
    0 references
    state complexity
    0 references
    regular languages
    0 references
    partial languages
    0 references
    partial words
    0 references
    deterministic finite automata
    0 references
    non-deterministic finite automata
    0 references

    Identifiers