Boundedness testing for unambiguous context-free grammars (Q594604)

From MaRDI portal
Revision as of 20:00, 1 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Boundedness testing for unambiguous context-free grammars
scientific article

    Statements

    Boundedness testing for unambiguous context-free grammars (English)
    0 references
    0 references
    1983
    0 references
    0 references
    bounded language
    0 references
    left Szilard language
    0 references
    polynomial time algorithm
    0 references
    unambiguous context-free grammars
    0 references