Two Complete Axiom Systems for the Algebra of Regular Events

@article{Salomaa1966TwoCA,
  title={Two Complete Axiom Systems for the Algebra of Regular Events},
  author={Arto Salomaa},
  journal={J. ACM},
  year={1966},
  volume={13},
  pages={158-169}
}
The theory of finite automata is closely linked with the theory of Kleene's regular expressions. In this paper, two formal systems for the algebraic transformation of regular expressions are developed. Both systems are consistent and complete; i.e., the set of equations derivable within the system equals the set of equations between two regular expressions denoting the same event. One of the systems is based upon the uniqueness of the solution of certain regular expression equations, whereas… 

A Complete Axiom System for Algebra of Closed-Regular Expression

The concept of cl-regular expression is introduced, the axiom system for cl- regular expressions is proposed, and the soundness and completeness of the system are proved.

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

A finitary axiomatization of the algebra of regular events involving only equations and equational implications that is sound for all interpretations over Kleene algebras is given. Axioms for Kleene

Omega Algebras and Regular Equations

A weak variant of omega algebra, where one of the usual star induction axioms is absent, is studied in the context of recursive regular equations, which yields a sound and complete axiomatisation in which the "regular" axiOMs are weaker than Kleene algebra.

The Axiomatization Problem of a Theory of Linear Languages

This paper presents algebraic characterizations of the class of contextfree lamguages that have the property that the number of necessary operations grows with growing cardinality of the underlying alphabet.

Automatic equivalence proofs for non-deterministic coalgebras

Rewriting Extended Regular Expressions

We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the

Regular Algebras

This work uses Isabelle/HOL for a detailed systematic study of regular algebras given by Boffa, Conway, Kozen and Salomaa, and formalises a soundness proof for the smallest class and obtains completeness of the largest one relative to a deep result by Krob.

A regular viewpoint on processes and algebra

While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey

Axioms for locality as product

We consider systems of finite state agents that are sequential in themselves and interact with each other by synchronously performing common actions together. We study reasoning about such systems
...

References

SHOWING 1-10 OF 13 REFERENCES

Realization of Events by Logical Nets

A new formulation and new proofs of Kleene’s analysis and synthesis theorems are given, in which no acquaintance with Kleene is presupposed, to make these important results more widely accessible.

Regular Expressions and State Graphs for Automata

Algorithms are presented for 1) converting a state graph describing the behavior of an automaton to a regular expression describing the behavior of the same automaton (section 2), and 2) for

Derivatives of Regular Expressions

In this paper the notion of a derivative of a regular expression is introduced atld the properties of derivatives are discussed and this leads, in a very natural way, to the construction of a state diagram from a regularexpression containing any number of logical operators.

Representation of Events in Nerve Nets and Finite Automata

This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.

Delayed-logic and finite-state machines

The paper's main results hinge on certain properties of a new type of state subgraph, and on an indirect application of permutation groups to the state-pair transition problem.

Rules to Manipulate Regular Expressions of Finite Automata

  • H. Ghiron
  • Computer Science
    IRE Trans. Electron. Comput.
  • 1962

On defining relations for the algebra of regular events

  • Ukrain. Mat. ~
  • 1964