Nonterminal complexity of programmed grammars. (Q1401269): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Accepting grammars with regulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional transfer in regulated rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regulated grammars under leftmost derivation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on blind and partially blind one-way multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri net algorithms in the theory of matrix grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy between context-free and context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines, computations, and universality. 3rd international conference, MCU 2001, Chişinǎu, Moldova, May 23--27, 2001. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic complexity of scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages / 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: Q3801102 / 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: Programmed Grammars and Classes of Formal Languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:49, 6 June 2024

scientific article
Language Label Description Also known as
English
Nonterminal complexity of programmed grammars.
scientific article

    Statements

    Nonterminal complexity of programmed grammars. (English)
    0 references
    0 references
    17 August 2003
    0 references
    Regulated rewriting
    0 references
    Descriptional complexity
    0 references
    Programmed grammars
    0 references
    Matrix grammars
    0 references
    Nonterminal complexity
    0 references

    Identifiers