Axiomatizing Shuffle and Concatenation in Languages

Information and Computation

Volumn 139, Issue 1, 1997, Pages 62-91

  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

EID: 0343242742     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2665     Document Type: Article

References (14)

1. Bloom, S. L., and Ésik, Z. (1993), Equational axioms for regular sets, Math. Structures Comput. Sci. 3, 1-24.
2. Bloom, S. L., and Ésik, Z. (1995), Nonfinite axiomatizability of shuffle inequalities, in "Proceedings of TAPSOFT '95," Lecture Notes in Computer Science, Vol. 915, pp. 318-333. Springer-Verlag, Berlin/New York.
3. Bloom, S. L., and Ésik, Z. (1996), Free shuffle algebras in language varieties, Theoret. Comput. Sci. 163, 55-98.
4. Bloom, S. L. (1976), Varieties of ordered algebras, J. Comput. System Sci. 45, 200-212.
5. Ésik, Z., and Bertol, M. (1995), Nonfinite axiomatizability of the equational theory of shuffle, in "Proceedings of ICALP'95," Lecture Notes in Computer Science, Vol. 944, pp. 27-38. Springer-Verlag, Berlin/New York.
6. Gischer, Jay L. (1984), "Partial Orders and the Axiomatic Theory of Shuffle," Ph.D. thesis, Computer Science Dept., Stanford University.
7. Gischer, Jay L. (1988), The equational theory of pomsets, Theoret. Comput. Sci. 61, 199-224.
8. Grabowski, Jan (1981), On partial languages, Fund. Inform. IV (2), 427-498.
9. Pratt, V. R. (1990), Action logic and pure induction, in "Logics in AI: European Workshop JELIA'90, Amsterdam, September 1990" (J. van Eijck, Ed.), Lecture Notes in Computer Science, Vol. 478, pp. 97-120, Springer-Verlag, Berlin/New York.
10. Tschantz, Steven T. (1994), Languages under concatenation and shuffling, Math. Structures Comput. Sci. 4, 505-511.
11. van Glabbeek, R. J. (1990), The refinement theorem for ST-bisimulation, in "IFIP TC2 Working Conference on Programming Concepts and Methods" (M. Broy and C. B. Jones, Eds.), Lecture Notes in Computer Science, pp. 27-52. North-Holland, Amsterdam.
12. van Glabbeek, R. J. (1995), "The Difference between Splitting in n and n + 1," Technical Report, CWI.
13. Valdes, J., Tarjan, R. E., and Lawler, E. L. (1981), The recognition of series-parallel digraphs, SIAM J. Comput. 11 (2), 298-313.
14. Vogler, Walter (1991), Failure semantics based on interval semiwords is a congruence for refinement, Distrib. Comput. 4, 139-162.