Nonterminal complexity of tree controlled grammars (Q719323): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sherzod Turaev / rank
 
Normal rank
Property / author
 
Property / author: Juergen Dassow / rank
 
Normal rank
Property / author
 
Property / author: Mohd Hasan Selamat / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070647957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regulated context-free rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered context grammars generate any recursively enumerable language with two nonterminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal complexity of programmed grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of scattered context-sensitivity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simultaneous reduction of several measures of descriptional complexity in scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional complexity of multi-parallel grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generative power of three-nonterminal scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding ET0L grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generative capacity of tree controlled grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six nonterminals are enough for generating each r.e. language by a matrix grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the descriptional complexity of some rewriting mechanisms regulated by context conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree controlled grammars / rank
 
Normal rank

Latest revision as of 11:48, 4 July 2024

scientific article
Language Label Description Also known as
English
Nonterminal complexity of tree controlled grammars
scientific article

    Statements

    Nonterminal complexity of tree controlled grammars (English)
    0 references
    10 October 2011
    0 references
    formal languages
    0 references
    regulated rewriting
    0 references
    tree controlled grammars
    0 references
    descriptional complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers