Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T09:24:39.892Z Has data issue: false hasContentIssue false
  • English
  • Français

Equational axioms for regular sets

Published online by Cambridge University Press:  04 March 2009

S. L. Bloom  and
Z. Ésik
S. L. Bloom
Affiliation:
Computer Science Department, Stevens Institute of Technology, Castle Point, Hoboken, NJ 07030
Z. Ésik
Affiliation:
Computer Science Department, A. József University, Szeged, Aradi v. tere 1, 6720 Hungary
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that, aside from the semiring equations, three equations and two equation schemes characterize the semiring of regular sets with the Kleene star operation.

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 3 , Issue 1 , March 1993 , pp. 1 - 24
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bloom, S. L. and Ésik, Z. (1985) Axiomatizing schemes and their behaviors. Journal of Computer and System Science 31 3375–393.CrossRefGoogle Scholar
Bloom, S. L. and Ésik, Z. (1988) Varieties of iteration theories. SIAM Journal of Computing 17 5939–966. Abstract in Bulletin of the European Association for Theoretical Computer Science 1984, 53–65.CrossRefGoogle Scholar
Bloom, S. L. and Ésik, Z. (1989) Equational logic of circular data type specification. Theoretical Computer Science 63 3303–331.CrossRefGoogle Scholar
Bloom, S. L. and Ésik, Z. (1991) Floyd-Hoare logic in iteration theories. Journal of the Association of Computing Machinery 38 4887–934.CrossRefGoogle Scholar
Bloom, S. L. and Ésik, Z. (1992) Program correctness and Matricial Iteration Theories. Mathematical Foundations of Programming Semantics 91. Springer Lecture Notes in Computer Science 598 457–76.CrossRefGoogle Scholar
Bloom, S. L. and Ésik, Z. (to appear a) Matrix and matricial iteration theories, Part I. Journal of Computer and System Science.Google Scholar
Bloom, S. L. and Ésik, Z. (to appear b) Matrix and matricial iteration theories, Part II. Journal of Computer and System Science.Google Scholar
Bloom, S. L. and Ésik, Z. (to appear c) Iteration algebras. International Journal of Foundations of Computer Science.Google Scholar
Bloom, S. L. and Ésik, Z. (submitted) Matrix and Matricial theories of regular sets. Stevens Research Report 9013.Google Scholar
Bloom, S. L., Ésik, Z. and Taubner, D. (to appear) Iteration theories of Synchronization trees. Information and Computation.Google Scholar
Conway, J. (1971) Regular Algebra and Finite Machines, Chapman and Hall, London.Google Scholar
Ésik, Z. (1981) An axiomatization of regular forests in the language of algebraic theories with iteration. Fundamentals of Computation Theory, Szeged (1981). Springer Lecture Notes in Computer Science 117 130–136.CrossRefGoogle Scholar
Gorshkov, P. V. and Arkhangelskii, K. V. (1987) Implicational axioms for the algebra of regular languages (in Russian). Doklady Akad. Nauk, Ukrainian SSR, ser A, 10 67–69.Google Scholar
Hebish, U. (1990) The Kleene theorem in countably complete semirings. Bayreuther Mathematische Schriften 31 55–66.Google Scholar
Kozen, D. (1981) On induction vs. -continuity, 1981. Proc. Workshop on Logics of Programs 1981. Springer Lecture Notes in Computer Science 131 167–176.CrossRefGoogle Scholar
Kozen, D. (1990) A completeness theorem for Kleene algebras and the algebra of regular events. Technical report, Cornell University, Department of Computer Science.Google Scholar
Lawvere, F.W. (1963) Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences USA, 50 869–873.CrossRefGoogle ScholarPubMed
Redko, V.N. (1964) On defining relations for the algebra of regular events (in Russian). Ukrain Mat. Zh. 16 120–126.Google Scholar
Salomaa, A. (1966) Two complete axiom systems for the algebra of regular events. Journal of the Association of Computing Machinery 13 1158–169.CrossRefGoogle Scholar
Salomaa, A. and Soittola, M. (1978) Automata Theoretic Aspects of Formal Power Series, Springer-Verlag.CrossRefGoogle Scholar