Nonterminal complexity of one-sided random context grammars (Q2428495): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-012-0150-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015467640 / 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: On the descriptional complexity of Watson-Crick automata / 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: A simultaneous reduction of several measures of descriptional complexity in scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for phrase-structure grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional complexity of multi-parallel grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the descriptional complexity of scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-sided random context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the descriptional complexity of semi-conditional grammars / 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

Latest revision as of 03:27, 5 July 2024

scientific article
Language Label Description Also known as
English
Nonterminal complexity of one-sided random context grammars
scientific article

    Statements

    Nonterminal complexity of one-sided random context grammars (English)
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references