A normal form theorem for label grammars
Copyright policy )A normal form theorem for label grammars
We characterize the images of Szilard languages under decreasing homomorphisms using so-called label grammars and show that each λ-free label language is in fact the coding of some Szilard language. This result shows that decreasing homomorphisms do not have more generating power on Szilard languages than codings, except that they generate the empty word. Label grammars naturally define a subclass of labelled Petri nets for which, unlike in the general case, it is now possible to eliminate λ-labelled transitions.
- Universität Hamburg Germany
context-free grammar, Szilard languages, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Formal languages and automata, firing sequences of labelled Petri nets, label language
context-free grammar, Szilard languages, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Formal languages and automata, firing sequences of labelled Petri nets, label language
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!