scientific article; zbMATH DE number 3883630
From MaRDI portal
Publication:3217622
[For the entire collection see Zbl 0543.00014.] This paper introduces closed regular expressions and proposes a complete axiom system for them. If the object is restricted to regular sets of finite strings then our axiom system coincides with \textit{A. Salomaa's} axiom system of regular expressions [J. Assoc. Comput. Mach. 13, 158-169 (1966; Zbl 0149.249)].
Recommendations
- A completeness theorem for Kleene algebras and the algebra of regular events
- Equational axioms for regular sets
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
- A Finite Axiomatization of Nondeterministic Regular Expressions
- Completeness results for omega-regular algebras
Cited in
(7)- A completeness theorem for Kleene algebras and the algebra of regular events
- The equational logic of fixed points
- Proof Pearl: regular expression equivalence and relation algebra
- On completeness of omega-regular algebras
- scientific article; zbMATH DE number 3919854 (Why is no real title available?)
- A Finite Axiomatization of Nondeterministic Regular Expressions
- Rewriting extended regular expressions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217622)