Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978707564 / rank
 
Normal rank

Revision as of 01:30, 20 March 2024

scientific article
Language Label Description Also known as
English
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
scientific article

    Statements

    Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    0 references
    bifix-free
    0 references
    factor-free
    0 references
    finite automaton
    0 references
    monoid
    0 references
    prefix-free
    0 references
    regular language
    0 references
    reversal
    0 references
    semigroup
    0 references
    suffix-free
    0 references
    syntactic complexity
    0 references
    0 references