Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.