A normal form theorem for label grammars

DOI10.1007/BF01752402zbMath0479.68077MaRDI QIDQ3938522

Manfred Opp, Matthias Jantzen

Publication date: 1981

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

context-free grammarSzilard languageslabel languagefiring sequences of labelled Petri nets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

On homomorphic images of szilard languages ⋮ On permutative grammars generating context-free languages

Cites Work

• Computation sequence sets
• Remarks on blind and partially blind one-way multicounter machines
• Petri nets and szilard languages
• An analysis of grammars by their derivation sets
• Associate languages and derivational complexity of formal grammars and languages
• Unnamed Item
• Unnamed Item
• Unnamed Item