Finite turns and the regular closure of linear context-free languages (Q2384399)

From MaRDI portal
Revision as of 18:51, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)





scientific article
Language Label Description Also known as
English
Finite turns and the regular closure of linear context-free languages
scientific article

    Statements

    Finite turns and the regular closure of linear context-free languages (English)
    0 references
    0 references
    0 references
    21 September 2007
    0 references
    finite turn pushdown automata
    0 references
    computational capacity
    0 references
    time-efficient recognizers
    0 references
    closures of languages
    0 references
    context-free languages
    0 references

    Identifiers