Skip to main content
SpringerLink
Log in

Commutative grammars

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

Commutative grammars are a formalism for generating bags, equivalent to vector addition systems and Petri nets. Known results are recalled and new one are presented on reachability and boundedness. In particular some subclasses of commutative grammars are introduced which admit a positive answer to these problems, and generate semilinear languages. Finally the equivalence, via Parikh mapping, of commutative and matrix grammars is proven.

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. Karp M. R., Miller R E.,Parailel program schemata, J. Comp. Syst. Sc.,3 (1969), 147–195.

    MATH  MathSciNet  Google Scholar 

  2. Petri C. A.,Kommunikation mit automaten, Schriften des Rheinish, Westfalishen Inst. fur Instrumentelle Mathematik (1962), Hft. 2, Bonn.

  3. Crespi-Reghizzi, S., Mandrioli D.,Petri nets and commutative, grammars, Rapp. N. 74–5, Istituto Elettronica del Politecnico di Milano, March 1974.

  4. Hack, M.,Analysis of Production schemata by Petri nets, Rept. MAC TR-94, MIT, Feb. 1972.

  5. Hack, M.,Decision Problems for Petri nets and vector addition systems, Comp. Structures Group Memo 95-2, MIT, Aug. 1974.

  6. Cerf V. G., et al.,Proper termination of flow of Control in programs involving concurrent processes, Proc. ACM Annual Conf., Boston, Aug. 1972, Vol. II, 742–754.

  7. Abraham, S.,Some questions of phrase structure grammars I, Computational Linguistics (1965), 61–70.

  8. Salomaa A, Formal languages (1973), Academic Press New York.

    MATH  Google Scholar 

  9. Holt A. W., Commoner, F.,Events and conditions, Project MAC Conf. Concurrent Systems and parallel computation, Woods Hole, Mass., 1970.

  10. Parikh R. J.,On context-free languages, J. ACM, 13 (1966), 570–581.

    Article  MATH  MathSciNet  Google Scholar 

  11. Ginsburg, S., The mathematical theory of context-free languages (1966), Mc Graw-Hill, New York.

    MATH  Google Scholar 

  12. Ginburg, S., Spanier, E. H.,Derivation bounded languages J. Comp. Syst. Sc.2 (1968), 228–250.

    Google Scholar 

  13. Greibach S. A.,A generalization of Parikh’s semilinear theorem, Discrete Math.2 (1972), 347–355.

    Article  MATH  MathSciNet  Google Scholar 

  14. Greibach, S.,Full AFLs and nested iterated substitution, Inform. and Contr.16 (1970), 7–35.

    Article  MATH  MathSciNet  Google Scholar 

  15. Ibarra, O. H.,Simple matrix languages, Inform. and Contr.17 (1970), 359–394.

    Article  MathSciNet  Google Scholar 

  16. Siromoney, R.,On equal matrix languages, Inform. and Contr.14 (1969), 135–151.

    Article  MATH  MathSciNet  Google Scholar 

  17. Crespi-Reghizzi, S., Mandrioli D,A decidability theorem for a class of vector addition systems, Info. Proc. Letters3 (1975), 78–80.

    Article  MATH  MathSciNet  Google Scholar 

  18. Van Leeuwen J.,A Partial Solution to the Reachability Problem for Vector Addition Systems 6th Annual ACM Symposium on Theory of Computing, May 1974, 303–309.

Download references

Author information

Authors and Affiliations

  1. Istituto di Elettrotecnica ed Elettronica del Politecnico e Centro CNR per l’Ingegneria dei Sistemi per l’Elaborazione dell’Informazione, Piazza L. Da Vinci, 32-20133, Milano

    S Crespi-Reghizzi & D. Mandrioli

Authors
  1. S Crespi-Reghizzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Mandrioli
    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

Crespi-Reghizzi, S., Mandrioli, D. Commutative grammars. Calcolo 13, 173–189 (1976). https://doi.org/10.1007/BF02575679

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation