Nonfinite axiomatizability of the equational theory of shuffle
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 27-38
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Completeness Theorem for Kleene Algebras and the Algebra of Regular EventsInformation and Computation, 1994
- Towards Action-Refinement in Process AlgebrasInformation and Computation, 1993
- Equational axioms for regular setsMathematical Structures in Computer Science, 1993
- Complete systems ofB-rational identitiesTheoretical Computer Science, 1991
- Action logic and pure induction1991
- The equational theory of pomsetsTheoretical Computer Science, 1988
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Varieties of ordered algebrasJournal of Computer and System Sciences, 1976
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966