On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based |
scientific article; zbMATH DE number 1238691
| 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; zbMATH DE number 1238691 |
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
