Nonfinite axiomatizability of the equational theory of shuffle

Acta Informatica

Volumn 35, Issue 6, 1998, Pages 505-539

  Ésik, Zoltán ^a   Bertol, Michael ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041169733     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050129     Document Type: Article

References (29)

1. L. Aceto: Full abstraction for series-parallel pomsets. In Proceedings of TAPSOFT '91, volume 493 of Lecture Notes in Computer Science, pp 1-40 Berlin Heidelberg New York Springer 1991
2. L. Aceto, M. Hennessy: Towards action refinement in process algebras. Information and Computation, 103(2):204-269 (1993)
3. K. V. Arhangelsky, P. V. Gorshkov: Implicational axioms for the algebra of regular languages. Dokl Akad. Nauk USSR Ser. A, 10:67-69, 1987. (in Russian)
4. S. L. Bloom: Varieties of ordered algebras. Journal of Computer and System Sciences 45:200-212 (1976)
5. L. Bernátsky, S. L. Bloom, Z. Ésik, Gh. Stefanescu: Equational theories of relations and regular sets, in: Proc. conf. Words, Languages and Combinatorics II. Kyoto, 1992, M. Ito, H. Jürgensen (Eds.) World Scientific, pp 40-48, 1994
6. S. L. Bloom, Z. Ésik: Equational axioms for regular sets. Mathematical Stuctures in Computer Science, 3:1-24 (1993)
7. S. L. Bloom, Z. Ésik: Free shuffle algebras in language varieties. Theoretical Computer Science, 163:55-98 (1996)
8. S. L. Bloom, Z. Ésik: Nonfinite axiomatizability of shuffle inequalities. In: Proceedings of TAPSOFT '95, LNCS 915, Berlin Heidelberg New York: Springer 1995, pp 318-333.
9. M. Boffa. Une remarque sur les systèmes complets d'identites rationelles. Theoret. Inform. Appl., 24:419-423 (1990)
10. M. Boffa: Une condition impliquant toutes les identites rationelles. Theoret. Inform. Appl., 29:515-518 (1995)
11. J. Conway. Regular Algebra and Finite Machines. Chapman & Hall, London, 1971
12. Z. Ésik, M. Bertol: Nonfinite axiomatizability of the equational theory of shuffle, in: Proc. ICALP'95, LNCS 944, pp 27-38, Berlin Heidelberg New York: Springer 1995
13. Z. Ésik, M. Ito, M. Katsura: The equational theory of reversal. To appear.
14. J. Feigenbaum, J. A. Kahn, C. Lund: Complexity results for pomset languages. SIAM Journal of Discrete Mathematics, 6(3):432-444 (1993)
15. Jay Loren Gischer: Partial orders and the axiomatic theory of shuffle. PhD thesis, Stanford University, Computer Science Dept., 1984
16. Jay Loren Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199-224 (1988)
17. Jan Grabowski. On partial languages. Fundamenta Informatica, IV(2):427-498 (1981)
18. D. Kozen: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110:366-390 (1994)
19. D. Krob: Complete systems of B-rational identities. Theoretical Computer Science, 89:207-343 (1991)
20. A. Meyer, A. Rabinovich: Private communication.
21. R. Milner: A Calculus for Communicating Systems. LNCS 92, Berlin Heidelberg New York: Springer (1980)
22. F. Moller: The importance of the left merge operator in process algebra, in: Proc. ICALP' 90, LNCS 443, pp 752-764. Berlin Heidelberg New York, Springer: 1990
23. Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Processing, 15(1):33-71 (1986)
24. Vaughan Pratt: Action structures and pure induction. Technical Report, Stanford University, Dept. of Computer Science, April 1991
25. V. N. Redko: On defining relations for the algebra of regular events. Ukrain. Mat. Z., 16:120-126, 1964 (in Russian)
26. V. N. Redko: On the algebra of commutative events. Ukrain. Mat. Z., 16:185-195, 1964 (In Russian)
27. Arto Salomaa: Two complete axiom systems for the algebra of regular events. J. ACM, 13:158-169 (1966)
28. S. T. Tschantz: Languages under concatenation and shuffling. Mathematical Structures in Computer Science, 4:505-511 (1994)
29. J. Valdes, R. E. Tarjan, E. L. Lawler: The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298-313 (1981)