|
233
|
Regular Algebra and Finite Machines
– J Conway
- 1971
|
|
318
|
Representation of events in nerve nets and finite automata
– S C Kleene
- 1956
|
|
70
|
Two complete axiom systems for the algebra of regular events
– A Salomaa
- 1966
|
|
87
|
Kleene algebra with tests
– Dexter Kozen
- 1997
|
|
20
|
On induction vs. *-continuity
– D Kozen
- 1981
|
|
16
|
A semiring on convex polygons and zerosum cycle problems
– K Iwano, K Steiglitz
- 1990
|
|
743
|
Dynamic Logic
– David Harel, Dexter Kozen, Jerzy Tiuryn
- 1984
|
|
33
|
Dynamic Algebras as a well-behaved fragment of Relation Algebras
– Vaughan Pratt
- 1990
|
|
25
|
Relation algebras with transitive closure
– Kan Ching Ng, Alfred Tarski
- 1977
|
|
312
|
Propositional dynamic logic of regular programs
– M J Fischer, R E Ladner
- 1979
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
33
|
On Hoare Logic and Kleene Algebra with Tests
– Dexter Kozen
|
|
31
|
Seperation and reduction
– E Cohen
- 2000
|
|
12
|
Dynamic algebras and the nature of induction
– V R Pratt
- 1980
|
|
28
|
On defining relations for the algebra of regular events
– V Redko
- 1964
|
|
23
|
The Kleene and the Parikh Theorem in Complete Semirings, Automata, languages and programming (Karlsruhe
– W Kuich
- 1987
|
|
114
|
The design and analysis of algorithms
– D Kozen
- 1991
|
|
14
|
Using Kleene algebra to reason about concurrency control
– E Cohen
- 1994
|
|
18
|
Process Algebra with Iteration
– Jan A. Bergstra, Inge Bethke, Alban Ponse
- 1994
|
