Skip to main content

Defining languages by Mazurkiewicz aigorithms

  • Formal Languages
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 28))

  • 2014 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BLIKLE,A.J.; MAZURKIEWICZ,A. An algebraic approach to the theory of programs, algorithms, languages and recursiveness. Mathematical Foundation of Computer Sciences (Int. Symp. and Sum. Sch., Warsaw, Jablonna, 1972).

    Google Scholar 

  2. MAZURKIEWICZ,A. Algorithms and grammars.(to appear).

    Google Scholar 

  3. OWSIANIECKA,W.A. Mazurkiewicz algorithms as a tool for defining formal languages.(in polish), unpublished doctoral dissertation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Owsianiecka, W.A. (1975). Defining languages by Mazurkiewicz aigorithms. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_687

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_687

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics