On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based |
scientific article |
Statements
On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (English)
0 references
12 January 1999
0 references
regular expressions
0 references
equational logic
0 references
complete axiomatizations
0 references
0 references
0 references
