Shuffle binoids

Theoretical Informatics and Applications

Volumn 32, Issue 4-6, 1998, Pages 175-198

  Bloom, S L ^a   Esik Z ^b  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032257275     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1998324-601751     Document Type: Article

References (22)

1. S. L. BLOOM, Varieties of ordered algebras. Journal of Computer and System Sciences, Vol. 45, 1976, pp. 200-212.
2. S. L. BLOOM and Z. ÉSIK, Nonfinite axiomatizability of shuffle inequalities. In Proceedings of TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, 1995, pp. 318-333.
3. S. L. BLOOM and Z. ÉSIK, Free shuffle algebras in language varieties. Theoretical Computer Science, Vol. 163, 1996, pp. 55-98.
4. S. L. BLOOM and Z. ÉSIK, Axiomatizing shuffle and concatenation in languages. Information and Computation, Vol. 139, 1997, pp. 62-91.
5. S. L. BLOOM, Z. ÉSIK and Gh. STEFANESCU, Equational theories of relations and regular sets. In Proc. of Words, Languages and Combinatorics, II, M. ITO and M. JURGENSEN Eds., Kyoto, 1992 World Scientific, 1994, pp. 40-48.
6. M. BOFFA, Une remarque sur les systèmes complets d'identités rationnelles, Theoret. Inform. Appl., Vol. 24, 1990, pp. 419-423.
7. M. BOFFA, Une condition impliquant toutes les identités rationnelles, Theoret. Inform. Appl., Vol. 29, 1995, pp. 515-518.
8. Z. ÉSIK and L. BERNÁTSKY, Scott induction and equational proofs, in: Mathematical Foundations of Programming Semantics'95, ENTCS, Vol. 1, 1995.
9. Z. ÉSIK and M. BERTOL, Nonfinite axiornatizability of the equational theory of shuffle. In Proceedings of ICALP'95. volume 944 of Lecture Notes in Computer Science, 1995, pp. 27-38.
10. Z. ÉSIK, Group axioms for iteration, Information and Computation, to appear.
11. J. L. GISCHER, Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, Computer Science Dept., 1984.
12. J. L. GISCHER, The equational theory of pomsets. Theoretical Computer Science, Vol. 61, 1988, pp. 199-224.
13. J. GRABOWSKI, On partial languages, Fundamenta Informatica, Vol. IV(2), 1981, pp. 427-498.
14. D. KOZEN, A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, Vol. 110, 1994, pp. 366-390.
15. D. KROB, Complete systems of B-rational identities, Theoretical Computer Science, Vol. 89, 1991, pp. 207-343.
16. L. KUCERA, Combinatorial Algorithms, Adam Hilger (Bristol and Philadelphia), 1990.
17. V. PRATT, Modeling concurrency with partial orders. Internat. J. Parallel Processing, Vol. 15, 1986, pp. 33-71.
18. W. THOMAS, Automata on infinite objects. In Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics, MIT Press, 1990, pp. 133-192.
19. Steven T. TSCHANTZ, Languages under concatenation and shuffling, Mathematical Structures in Computer Science, Vol. 4, 1994, pp. 505-511.
20. J. VALDES, R. E. TARJAN and E. L. LAWLER, The recognition of series-parallel digraphs. SIAM Journal of Computing, Vol. 11(2), 1981, pp. 298-313.
21. T. WILKE, An algebraic theory for regular languages of finite and infinite words. International Journal of Algebra and Computation, Vol. 3, 1993, pp. 447-489.
22. T. WILKE, An Eilenberg Theorem for ∞-languages. In "Automata, Languages and Programming", Proc. of 18th ICALP Conference, Vol. 510 of Lecture Notes in Computer Science, 1991, pp. 588-599.