Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Free shuffle algebras in language varieties extended abstract

  • Conference paper
  • First Online:
LATIN '95: Theoretical Informatics (LATIN 1995)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto. Full abstraction for series-parallel pomsets. In Proceedings of TAPSOFT '91, volume 493 of Lecture Notes in Computer Science, pages 1–40. Springer-Verlag, 1991.

    Google Scholar 

  2. L. Aceto and M. Hennessy. Towards action refinement in process algebras. Information and Computation, 103(2):204–269, 1993.

    Article  Google Scholar 

  3. S. L. Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 45:200–212, 1976.

    Google Scholar 

  4. S. L. Bloom and Z. Ésik. Nonfinite Axiomatizability of Shuffle Inequalities. To appear in Proceedings of TAPSOFT/CAAP '95.

    Google Scholar 

  5. Z. Esik and M. Bertol. Nonfinite Axiomatizability of the Equational Theory of Shuffle. To appear.

    Google Scholar 

  6. J. Feigenbaum, J. A. Kahn, C. Lund. Complexity results for pomset languages. SIAM Journal of Discrete Mathematics, 6(3): 432–442, 1993.

    Google Scholar 

  7. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the theory of NP completeness W. H. Freeman, 1979.

    Google Scholar 

  8. Jay Loren Gischer. Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, Computer Science Dent., 1984.

    Google Scholar 

  9. Jay Loren Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199–224, 1988.

    Article  Google Scholar 

  10. Jan Grabowski. On partial languages. Fundamenta Informatica, IV(2):427–498, 1981.

    Google Scholar 

  11. Ludek Kucera. Combinatorial Algorithms Adam Hilger, Bristol and Philadelphia, 1990.

    Google Scholar 

  12. A. Meyer and A. Rabinovich. Private communication.

    Google Scholar 

  13. Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Processing, 15(1):33–71, 1986.

    Google Scholar 

  14. C. Stirling. Temporal logic for CCS. In G. Rozenberg J.W. de Bakker, W.-P. de Roever, editor, Linear Time, Branching Time and Partial Order in Logics and Models of Concurrency, volume 354 of Lecture Notes in Computer Science, pages 660–672, 1989.

    Google Scholar 

  15. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298–313, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stevens Institute of Technology, 07030, Hoboken, NJ

    Stephen L. Bloom

  2. Department of Computer Science, A. József University, Szeged, Hungary

    Zoltán Ésik

Authors
  1. Stephen L. Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ricardo Baeza-Yates Eric Goles Patricio V. Poblete

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, S.L., Ésik, Z. (1995). Free shuffle algebras in language varieties extended abstract. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_84

Download citation

  • DOI: https://doi.org/10.1007/3-540-59175-3_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59175-7

  • Online ISBN: 978-3-540-49220-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation