Skip to search formSkip to main contentSkip to account menu

Kleene algebra

Known as: Regular, Regular algebra 
In mathematics, a Kleene algebra (/ˈkleɪni/ KLAY-nee; named after Stephen Cole Kleene) is an idempotent (and thus partially ordered) semiring endowed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Action algebraCategory theoryConcatenationConcurrent computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Closed form of the Baker–Campbell–Hausdorff formula for the generators of semisimple complex Lie algebras
Recently it has been introduced an algorithm for the Baker–Campbell–Hausdorff (BCH) formula, which extends the Van-Brunt and… 
2010
2010
Monadic extensions of institutions
2007
2007
Personalisation of web information systems - A term rewriting approach
2005
2005
On Partially Additive Kleene Algebras
We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be… 
2003
2003
Pointer Kleene Algebra
  • T. Ehm
  • RelMiCS
  • 2003
  • Corpus ID: 30608658
We present an extension of Kleene algebra (KA) that can be used for modeling a record based view of pointer structures. This is… 
2003
2003
Partially ordered monads and powerset Kleene algebras
. Monads are used for various applications in computer science, and well-known is e.g. the interpretation of morphisms in the… 
Review
2000
Review
2000
Fundamental Properties on Axioms of Kleene Algebra
The research works on axioms of Kleene algebra are surveyed and the fundamental properties of axioms of Kleene algebra are… 
1998
1998
On the Union of Well-Founded Relations
We give a criterion for the union of well-founded (i.e., noetherian) relations to be well-founded, generalizing results of Geser… 
1998
1998
Image segmentation based on Kleene algebra
This paper proposes a segmentation method based on Kleene Algebra. For an input image including some regions of interests (ROIs… 
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)