A normal form theorem for label grammars (Q3938522): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Petri nets and szilard languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of grammars by their derivation sets / 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: Q3048282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associate languages and derivational complexity of formal grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation sequence sets / rank
 
Normal rank

Latest revision as of 15:10, 13 June 2024

scientific article
Language Label Description Also known as
English
A normal form theorem for label grammars
scientific article

    Statements

    A normal form theorem for label grammars (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    Szilard languages
    0 references
    context-free grammar
    0 references
    label language
    0 references
    firing sequences of labelled Petri nets
    0 references