Skip to main content
SpringerLink
Log in

A normal form theorem for label grammars

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Arnold and M. Latteux, Vector addition systems and semi-Dyck Languages, Publication No. 78, Laboratoire de Calcul, Univ. Lille (1976).

  2. S. Crespi-Reghizzi, Petri nets and Szilard languages,Information and Control 33, 177–192 (1977).

    Google Scholar 

  3. A. C. Fleck, an analysis of grammars by their derivation sets,Information and Control 24, 389–398 (1974).

    Google Scholar 

  4. S. A. Greibach, Remarks on blind and partially blind one-way multi-counter machines,Theoretical Computer Science 7, 311–324 (1978).

    Google Scholar 

  5. M. Hack, Petri Net Languages, Computation Structures Group Memo 124, Project MAC, M.I.T. (1975).

  6. M. Höpner, Über den Zusammenhang von Szilard sprachen und Matrix-grammatiken, Bericht Nr. IFI-HH-B-12/74, Univ. Hamburg (1974).

  7. M. Höpner and M. Opp, About three equational classes of languages built up by shuffle operations, Lecture Notes in Computer Science, Springer, vol. 45, pp. 337–344 (1976).

    Google Scholar 

  8. T. Järvi, On control sets induced by grammars,Ann. Acad. Sc. Tenn. Ser. A 1, 480 (1970).

    Google Scholar 

  9. M. Jantzen, On the hierarchy of petri net languages,R.A.I.R.O. Informatique théorique 13, 19–30 (1979).

    Google Scholar 

  10. E. Moriya, Associate languages and derivational complexity of formal grammars and languages,Information and Control 22, 139–162 (1973).

    Google Scholar 

  11. M. Penttonen, On derivation languages corresponding to context-free grammars,Acta Informatica 3, 285–293 (1974).

    Google Scholar 

  12. J. L. Peterson, Computation sequence sets,J. Computer and System Sci. 13, 1–24 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Schlüterstr. 70, D-2000, Hamburg 13, West Germany

    Matthias Jantzen & Manfred Opp

Authors
  1. Matthias Jantzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Opp
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jantzen, M., Opp, M. A normal form theorem for label grammars. Math. Systems Theory 14, 289–303 (1981). https://doi.org/10.1007/BF01752402

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01752402

Keywords

Search

Navigation