Nonterminal complexity of programmed grammars. (Q1401269)

From MaRDI portal
Revision as of 09:49, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Nonterminal complexity of programmed grammars.
scientific article

    Statements

    title
    Nonterminal complexity of programmed grammars. (English)
    0 references
    author
    Henning Fernau
    0 references
    publication date
    17 August 2003
    0 references
    zbMATH DE Number
    1965298
    0 references
    zbMATH Keywords
    Regulated rewriting
    0 references
    Descriptional complexity
    0 references
    Programmed grammars
    0 references
    Matrix grammars
    0 references
    Nonterminal complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1401269&oldid=34346883"
    Powered by MediaWiki