zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On Kleene algebras and closed semirings. (English) Zbl 0732.03047
Mathematical foundations of computer science, Proc. 15th Symp., MFCS ’90, Banská Bystrica/Czech. 1990, Lect. Notes Comput. Sci. 452, 26-47 (1990).

Summary: [For the entire collection see Zbl 0731.00026.]

Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras and related algebraic structures.

Here we establish some new relationships among these structures. Our main results are: There is a Kleene algebra in the sense of the author’s “A completeness theorem for Kleene algebras and the algebra of regular events” [Cornell TR 90-1123 (1990)] that is not * -continuous. The categories of * -continuous Kleene algebras, closed semirings and S-algebras [J. H. Conway, Regular algebra and finite machines (1971; Zbl 0231.94041)] are strongly related by adjunctions. The axioms of Kleene algebra in the sense of the author [loc. cit.] are not complete for the universal Horn theory of the regular events. This refutes a conjecture of Conway [loc. cit.]. Right-handed Kleene algebras are not necessarily left-handed Kleene algebras. This verifies a weaker version of a conjecture of V. Pratt [“Dynamic algebras as a well-behaved fragment of relation algebras”, Proc. Conf. Algebra and Comput. Sci., Ames, Iowa 1988, Lect. Notes Comput. Sci. (to appear)].


MSC:
03G25Other algebras related to logic
18A40Adjoint functors
68Q70Algebraic theory of languages and automata