Preview
Unable to display preview. Download preview PDF.
References
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.
L. Aceto and M. Hennessy. Towards action refinement in process algebras. Information and Computation, 103(2):204–269, 1993.
S. L. Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 45:200–212, 1976.
S. L. Bloom and Z. Ésik. Nonfinite Axiomatizability of Shuffle Inequalities. To appear in Proceedings of TAPSOFT/CAAP '95.
Z. Esik and M. Bertol. Nonfinite Axiomatizability of the Equational Theory of Shuffle. To appear.
J. Feigenbaum, J. A. Kahn, C. Lund. Complexity results for pomset languages. SIAM Journal of Discrete Mathematics, 6(3): 432–442, 1993.
M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the theory of NP completeness W. H. Freeman, 1979.
Jay Loren Gischer. Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, Computer Science Dent., 1984.
Jay Loren Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199–224, 1988.
Jan Grabowski. On partial languages. Fundamenta Informatica, IV(2):427–498, 1981.
Ludek Kucera. Combinatorial Algorithms Adam Hilger, Bristol and Philadelphia, 1990.
A. Meyer and A. Rabinovich. Private communication.
Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Processing, 15(1):33–71, 1986.
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.
J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298–313, 1981.
Author information
Authors and Affiliations
Editor information
Rights 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