Free shuffle algebras in language varieties

Theoretical Computer Science

Volumn 163, Issue 1-2, 1996, Pages 55-98

  Bloom, Stephen L ^a   Ésik, Zoltán ^b  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SET THEORY;

FREE SHUFFLE ALGEBRA; MONOID; SHUFFLE SEMIRINGS;

COMPUTATIONAL LINGUISTICS;

EID: 0030214497     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00230-8     Document Type: Review

References (19)

1. L. Aceto, Full abstraction for series-parallel pomsets, in: Proc. TAPSOFT '91, Lecture Notes in Computer Science, Vol. 493 (Springer, Berlin, 1991) 1-40.
2. L. Aceto and M. Hennessy, Towards action refinement in process algebras, Inform. and Comput. 103 (1993) 204-269.
3. S.L. Bloom, Varieties of ordered algebras, J. Comput. System Sci. 45 (1976) 200-212.
4. S.L. Bloom and Z. Ésik, Free shuffle algebras in language varieties: extended abstract, in: Proc. Latin '95 Theoretical Informatics, Lecture Notes in Computer Science, Vol. 911 (Springer, Berlin, 1995) 99-111.
5. S.L. Bloom and Z. Ésik, Nonfinite axiomatizability of shuffle inequalities, in: Proc. TAPSOFT '95, Lecture Notes in Computer Science, Vol. 915 (Springer, Berlin, 1995) 318-333.
6. Z. Ésik and M. Bertol, Nonfinite axiomatizability of the equational theory of shuffle, in: Proc. ICALP '95, Lecture Notes in Computer Science, Vol. 944 (Springer, Berlin, 1995) 27-38.
7. J. Feigenbaum, J.A. Kahn and C. Lund, Complexity results for pomset languages, SIAM J. Discrete Math. 6 (1993) 432-442.
8. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP Completeness (Freeman, New York, 1979).
9. J.L. Gischer, Partial orders and the axiomatic theory of shuffle, Ph.D. Thesis, Stanford University, Computer Science Dept., 1984.
10. J.L. Gischer, The equational theory of pomsets, Theoret. Comput. Sci. 61 (1988) 199-224.
11. J. Grabowski, On partial languages, Fund Inform. IV (1981) 427-498.
12. L. Kucera, Combinatorial Algorithms (Adam Hilger, Bristol, 1990).
13. A.J. Mayer and L.J. Stockmeyer, The complexity of word problems - this time with interleaving, Inform. and Comput. 115 (1994) 293-311.
14. A. Meyer, Some decision problems. Abstract of an Invited Talk, in: Proc. STACS '95, Lecture Notes in Computer Science, Vol. 900 (Springer, Berlin, 1995) 349.
15. A. Meyer and A. Rabinovich, private communication.
16. V. Pratt, Modeling concurrency with partial orders, Internat. J. Parallel Processing 15 (1986) 33-71.
17. C. Stirling, Temporal logic for CCS, in: G. Rozenberg, J.W. de Bakker and W.-P. de Roever, eds., Linear Time, Branching Time and Partial Order in Logics and Models of Concurrency, Lecture Notes in Computer Science, Vol. 354 (Springer, Berlin, 1989) 660-672.
18. S.T. Tschantz, Languages under concatenation and shuffling, Math. Struct. Comput. Sci. 4 (1994) 505-511.
19. J. Valdes, R.E. Tarjan and E.L. Lawler, The recognition of series-parallel digraphs. SIAM J. Comput. 11 (1981) 298-313.