Selected papers that cite this one
- Luca Aceto and Wan Fokkink. An equational axiomatization for multi-exit iteration. Information and Computation, 137(2):121-158, 15 September 1997.
- Luca Aceto, Wan Fokkink, and Anna Ingólfsdóttir. A menagerie of non-finitely based process semantics over BPA* -- from ready simulation to completed traces. Mathematical Structures in Computer Science, 8(3):193-230, June 1998.
- Luca Aceto, Wan Fokkink, and Anna Ingólfsdóttir. On a question of A. Salomaa: The equational theory of regular expressions over a singleton alphabet is not finitely based. Theoretical Computer Science, 209(1-2):163-178, 6 December 1998.
- S. L. Bloom and Z. Ésik. Equational axioms for regular sets. Mathematical Structures in Computer Science, 3(1):1-24, March 1993.
- Stephen L. Bloom and Zoltán Ésik. The equational logic of fixed points. Theoretical Computer Science, 179(1-2):1-60, 1 June 1997. Tutorial.
- Stephen L. Bloom, Zoltán Ésik, and Dirk Taubner. Iteration theories of synchronization trees. Information and Computation, 102(1):1-55, January 1993.
- Henk Doornbos, Roland Backhouse, and Jaap van der Woude. A calculational approach to mathematical induction. Theoretical Computer Science, 179(1-2):103-135, 1 June 1997. Fundamental Study.
- Z. Ésik. Axiomatizing the equational theory of regular tree languages (extended abstract). In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 455-465, Paris France, 25-27 February 1998. Springer.
- Z. Ésik and L. Bernátsky. Equational properties of Kleene algebras of relations with conversion. Theoretical Computer Science, 137(2):237-251, 23 January 1995.
- A. Ginzburg. A procedure for checking equality of regular expressions. Journal of the ACM, 14(2):355-362, April 1967.
- R. J. van Glabbeek. Notes on the methodology of CCS and CSP. Theoretical Computer Science, 177(2):329-349, 15 May 1997.
- Dexter Kozen. On the complexity of reasoning in Kleene algebra. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 195-202, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.
- Dexter C. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390, 1 May 1994.
- Peter Sewell. Nonaxiomatisability of equivalences over finite state processes. Annals of Pure and Applied Logic, 90(1-3):163-191, 15 December 1997.
- Peter Sewell. Bisimulation is not finitely (first order) equationally axiomatisable. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 62-70, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
- Guo-Qiang Zhang. Automata, Boolean matrices, and ultimate periodicity. Accepted for publication in Information and Computation. Final manuscript received for publication November 30, 1998.
Selected references
- Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, October 1964.
- Irving M. Copi, Calvin C. Elgot, and Jesse B. Wright. Realization of events by logical nets. Journal of the ACM, 5(2):181-196, April 1958.