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, Rob van Glabbeek, Wan Fokkink, and Anna Ingólfsdóttir. Axiomatizing prefix iteration with silent steps. Information and Computation, 127(1):26-40, 25 May 1996.
- Michael Arbib. Turing machines, finite automata and neural nets. Journal of the ACM, 8(4):467-475, October 1961.
- Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, October 1964.
- Seymour Ginsburg. Sets of tapes accepted by different types of automata. Journal of the ACM, 8(1):81-86, January 1961.
- Arto Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13(1):158-169, January 1966.
- Peter Sewell. Nonaxiomatisability of equivalences over finite state processes. Annals of Pure and Applied Logic, 90(1-3):163-191, 15 December 1997.
Selected references
- Arthur W. Burks and Hao Wang. The logic of automata -- part I. Journal of the ACM, 4(2):193-218, April 1957.
- Arthur W. Burks and Hao Wang. The logic of automata -- part II. Journal of the ACM, 4(3):279-297, July 1957.