Descriptional complexity of bounded context-free languages (Q383365)

From MaRDI portal
Revision as of 15:43, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/iandc/MalcherP13, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Descriptional complexity of bounded context-free languages
scientific article

    Statements

    Descriptional complexity of bounded context-free languages (English)
    0 references
    0 references
    0 references
    4 December 2013
    0 references
    automata
    0 references
    formal languages
    0 references
    descriptional complexity
    0 references
    finite-turn pushdown automata
    0 references
    recursive trade-offs
    0 references
    bounded languages
    0 references

    Identifiers