On a question of A. Salomaa: The equational theory of regular expressions over a singleton alphabet is not finitely based

Theoretical Computer Science

Volumn 209, Issue 1-2, 1998, Pages 163-178

  Aceto, Luca ^a   Fokkink, Wan ^b   Ingólfsdóttir, Anna ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Complete axiomatizations; Equational logic; Regular expressions

Indexed keywords

EID: 0001706862     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00104-7     Document Type: Article

References (21)

1. L. Aceto, W.J. Fokkink, A. Ingólfsdóttir, A menagerie of non-finitely based process semantics over BPA*: from ready simulation to completed traces, Research Report RS-96-23, BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, Aalborg University, July 1996. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/96/23. To appear in Math. Struct. Comput. Sci.
2. S.L. Bloom, Varieties of ordered algebras, J. Comput. System Sci. 13 (1976) 200-212.
3. S.L. Bloom, Z. Ésik, Equational axioms for regular sets, Math. Struct. Comput. Sci. 3 (1993) 1-24.
4. S.L. Bloom, Z. Ésik, Iteration theories: The equational logic of iterative processes, in: W. Brauer, G. Rozenberg, A. Salomaa (Eds.), EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1993.
5. A.B. Rigny, D. Krob, A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring, Theoret. Comput. Sci. 134 (1994) 27-50.
6. J.H. Conway, Regular algebra and finite machines, in: R. Brown, J. De Wet (Eds.), Mathematics Series Chapman & Hall, London, 1971.
7. Z. Ésik, Independence of the equational axioms for iteration theories, J. Comput. System Sci. 36 (1988) 66-76.
8. S. Kleene, Representation of events in nerve nets and finite automata, in: C. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, NJ, 1956, pp. 3-41.
9. D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, Inform. Comput. 110 (1994) 366-390.
10. D. Krob, Complete systems of B-rational identities, Theoret. Comput. Sci. 89 (1991) 207-343.
11. D. Krob, Models of a K-rational identity system, J. Comput. System Sci. 45 (1992) 396-434.
12. I. Niven, H. Zuckerman, An Introduction to the Theory of Numbers, 2nd ed., Wiley, New York, 1960.
13. D. Perrin, Finite automata, in: J. van Leeuwen (Ed.), chapter 1, Formal Models and Semantics, Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 1-57.
14. V. Redko, On defining relations for the algebra of regular events, Ukrain Mat. Zh. 16 (1964) 120-126 (in Russian).
15. V. Redko, On the algebra of commutative events, Ukrain Mat. Zh. 16 (1964) 185-195 (in Russian).
16. A. Salomaa, Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach. 13 (1966) 158-169.
17. A. Salomaa, Theory of Automata, in: I.N. Sneddon, M. Stark (Eds.), International Series of Monographs in Pure and Applied Mathematics, vol. 100 Pergamon Press, Oxford, 1969.
18. A. Salomaa, Personal communication, June 1996.
19. P.M. Sewell, Bisimulation is not finitely (first order) equationally axiomatisable, in: Proc. 9th Ann. Symp. on Logic in Computer Science, Paris, France, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 62-70.
20. P.W. Sewell, Nonaxiomatisability of equivalences over finite state processes, September 1996. Draft paper available from the World Wide Web at the URL http://www.cl.cam.ac.uk/users/pes20/.
21. T. Urponen, On regular expressions over one letter and on commutative languages, Tech. Report A517, Annales Academiae Scientiarum Fennicae, 1972.