Abstract
We consider language structures B Σ = (P Σ , ·, ⊗, +, 1,0), where P Σ consists of all subsets of the free monoid σ*; the binary operations ·, ⊗ and + are concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety Lang generated by the structures L Σ has no finite axiomatization.
Partially supported by grant No. T7383 of the National Foundation for Scientific Research of Hungary, the Alexander von Humboldt Foundation, and by the US-Hungarian Joint Fund under grant number 351.
Partially supported by the ESPRIT Basic Research Actions No. 6317 ASMICS II.
This is a preview of subscription content, log in via an institution to check access.
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.
K. B. Arkhangelskii and P. V. Gorshkov. Implicational axioms for the algebra of regular languages. Dokl. Akad. Nauk USSR Ser. A, 10:67–69, 1987. (in Russian)
S. L. Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 45:200–212, 1976.
S. L. Bloom and Z. ésik. Equational axioms for regular sets. Mathematical Stuctures in Computer Science, 3:1–24, 1993.
S. L. Bloom and Z. ésik. Free shuffle algebras in language varieties. Full version submitted for publication. Extended abstract to appear in the proceedings of LATIN '95.
S. L. Bloom and Z. ésik. Nonfinite axiomatizability of shuffle inequalities. In: Proceedings of TAPSOFT '95, LNCS 915, Springer-Verlag, 1995, 318–333.
M. Boffa. Une remarque sur les systèmes complets d'identites rationelles. Theoret. Inform. Appl., 24:419–423, 1990.
J. Conway. Regular Algebra and Finite Machines. Chapman & Hall, London, 1971.
J. Feigenbaum, J. A. Kahn, C. Lund. Complexity results for pomset languages. SIAM Journal of Discrete Mathematics, 6(3):432–444, 1993.
Jay Loren Gischer. Partial orders and the axiomatic theory of shuffle. PhD thesis, Stanford University, Computer Science Dept., 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.
D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110:366–390, 1994.
D. Krob. Complete systems of B-rational identities. Theoretical Computer Science, 89:207–343, 1991.
A. Meyer and A. Rabinovich. Private communication.
Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Processing, 15(1):33–71, 1986.
Vaughan Pratt. Action structures and pure induction. Technical Report, Stanford University, Dept. of Computer Science, April 1991.
V. N. Redko. On defining relations for the algebra of regular events. Ukrain. Mat. Z., 16:120–126, 1964. (in Russian)
Arto Salomaa. Two complete axiom systems for the algebra of regular events. J. ACM, 13:158–169, 1966.
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
ésik, Z., Bertol, M. (1995). Nonfinite axiomatizability of the equational theory of shuffle. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_60
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive