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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.01.021 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997453642 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.01.021 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:40, 18 December 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