Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Deciding regularity of hairpin completions of regular languages in polynomial time
scientific article

    Statements

    Deciding regularity of hairpin completions of regular languages in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    hairpin completion
    0 references
    regular language
    0 references
    finite automaton
    0 references
    unambiguous linear language
    0 references
    rational growth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references