THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 10:01, 5 March 2024

scientific article
Language Label Description Also known as
English
THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
scientific article

    Statements

    THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (English)
    0 references
    0 references
    0 references
    29 August 2012
    0 references
    0 references
    regular expressions
    0 references
    finite automata
    0 references
    transformations
    0 references
    descriptional complexity
    0 references
    computational complexity
    0 references
    formal language problems
    0 references
    operation problems
    0 references