On the complexity of reasoning in Kleene algebra

Information and Computation

Volumn 179, Issue 2, 2002, Pages 152-162

  Kozen, Dexter ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

KLEENE ALGEBRA (KA);

COMPUTATIONAL COMPLEXITY;

EID: 0037115181     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2960     Document Type: Conference Paper

References (34)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. (1975), "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA.
2. Anderaa, S. (1965), On the algebra of regular expressions, in "Applied Mathematics," pp. 1-18, Harvard Univ. Press, Cambridge, MA.
3. Archangelsky, K.V. (1992), A new finite complete solvable quasiequational calculus for algebra of regular languages, manuscript, Kiev State University.
4. Backhouse, R.C. (1975), "Closure Algorithms and the Star-Height Problem of Regular Languages," Ph.D. thesis, Imperial College, London, UK.
5. Berstel, J. (1979), "Transductions and Context-free Languages," Teubner, Stuttgart.
6. Bloom, S.L., and Ésik, Z. (1993), Equational axioms for regular sets, Math. Structures Comput. Sci. 3, 1-24.
7. Boffa, M. (1990), Une remarque sur les systèmes complets d'identités rationnelles, Inform. Théoret. Appl./Theoret. Inform. Appl. 24, 419-423.
8. Cohen, E. (1994), Hypotheses in Kleene algebra, available at ftp://ftp.bellcore.com/pub/ernie/research/homepage.html.
9. Cohen, E. (1994), Lazy caching, available at ftp://ftp.bellcore.com/pub/ernie/research/homepage.html.
10. Cohen, E. (1994), Using Kleene algebra to reason about concurrency control, available at ftp://ftp.bellcore.com/pub/ernie/research/homepage.html.
11. Cohen, E., Kozen, D., and Smith, F. (1996), The complexity of Kleene Algebra with tests, Tech. Rep. 96-1598, Computer Science Department, Cornell University.
12. Conway, J.H. (1971), "Regular Algebra and Finite Machines," Chapman & Hall, London.
13. Davis, M. (1958), "Computability and Unsolvability," McGraw-Hill, New York.
14. Gibbons, A., and Rytter, W. (1986), On the decidability of some problems about rational subsets of free partially commutative monoids, Theoret. Comput. Sci. 48, 329-337.
15. Hinman, P.G. (1977), "Recursion Theoretic Hierarchies," Springer-Verlag, New York.
16. Iwano, K., and Steiglitz, K. (1990), A semiring on convex polygons and zero-sum cycle problems, SIAM J. Comput. 19, 883-901.
17. Kleene, S.C. (1956), Representation of events in nerve nets and finite automata, in "Automata Studies" (C.E. Shannon and J. McCarthy, Eds.), pp. 3-41, Princeton Univ. Press, Princeton, NJ.
18. Kozen, D. (1981), On induction vs. *-continuity, in "Proceedings, Workshop on Logic of Programs" (D. Kozen, Ed.), Lecture Notes in Computer Science, Vol. 131, pp. 167-176, Springer-Verlag, New York.
19. Kozen, D. (1990), On Kleene algebras and closed semirings, in "Proceedings, Mathematical Foundations Computer Science, Banska-Bystrica, Slovakia" (Rovan, Ed.), Lecture Notes in Computer Science, Vol. 452, pp. 26-47, Springer-Verlag, New York.
20. Kozen, D. (1991), A completeness theorem for Kleene algebras and the algebra of regular events, in "Proceedings 6th Symposium Logic in Computer Science," pp. 214-225, IEEE, Amsterdam.
21. Kozen, D. (1991), "The Design and Analysis of Algorithms," Springer-Verlag, New York.
22. Kozen, D. (1994), A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput. 110, No. 2, 366-390.
23. Kozen, D. (1996), Kleene algebra with tests and commutativity conditions, in "Proceedings, Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), Passau, Germany" (T. Margaria and B. Steffen, Eds.), Lecture Notes in Computer Science, Vol. 1055, pp. 14-33, Springer-Verlag, Berlin.
24. Krob, D. (1991), A complete system of B-rational identities, Theoret. Comput. Sci. 89, 207-343.
25. Kuich, W. (1987), The Kleene and Parikh theorem in complete semirings, in "Proceedings, 14th Colloquium Automata, Languages, and Programming" (T. Ottmann, Ed.), Lecture Notes in Computer Science, Vol. 267, EATCS, pp. 212-225, Springer-Verlag, Berlin.
26. Kuich, W., and Salomaa, A. (1986), "Semirings, Automata, and Languages," Springer-Verlag, Berlin.
27. Mayr, E.W., and Meyer, A. (1982), The complexity of the word problems for commutative semigroups and polynomial ideals, Adv. Math. 46, 305-329.
28. Meseguer, J., and Goguen, J.A. (1985), Initiality, induction and computability, in "Algebraic Methods in Semantics" (M. Nivat and J.C. Reynolds, Eds.), pp. 460-541, Cambridge Univ. Press, Cambridge, UK.
29. Ng, K.C. (1984), "Relation Algebras with Transitive Closure," Ph.D. thesis, University of California, Berkeley.
30. Pratt, V. (1988), Dynamic algebras as a well-behaved fragment of relation algebras, in "Proceedings, Conference on Algebra and Computer Science, Ames, Iowa" (D. Pigozzi, Ed.), Lecture Notes in Computer Science, Vol. 425, pp. 77-110, Springer-Verlag, Berlin.
31. Redko, V.N. (1964), On defining relations for the algebra of regular events, Ukraïn. Mat. Z. 16, 120-126. [In Russian].
32. Sakarovitch, J. (1987), Kleene's theorem revisited: A formal path from Kleene to Chomsky, in "Trends, Techniques, and Problems in Theoretical Computer Science" (A. Kelemenova and J. Keleman, Eds.), Lecture Notes in Computer Science, Vol. 281, pp. 39-50, Springer-Verlag, New York.
33. Salomaa, A. (1966), Two complete axiom systems for the algebra of regular events, J. ACM 13, 158-169.
34. Tarski, A. (1941), On the calculus of relations, J. Symbolic Logic 6, 65-106.