On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
From MaRDI portal
Publication:1274921
DOI10.1016/S0304-3975(97)00104-7zbMath0915.68117MaRDI QIDQ1274921
Anna Ingólfsdóttir, Luca Aceto, W. J. Fokkink
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Axiomatizing recursion-free, regular monitors ⋮ Equational theories for automata ⋮ On axioms for commutative regular equations without addition. ⋮ On equations for union-free regular languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence of the equational axioms for iteration theories
- Complete systems of \(\mathcal B\)-rational identities
- Models of a \(K\)-rational identity system
- Varieties of ordered algebras
- A completeness theorem for Kleene algebras and the algebra of regular events
- A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- Equational axioms for regular sets
- Two Complete Axiom Systems for the Algebra of Regular Events
This page was built for publication: On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
