Pages that link to "Item:Q1274921"
From MaRDI portal
The following pages link to On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921):
Displaying 6 items.
- Equivalence of regular expressions over a partially commutative alphabet (Q1040402) (← links)
- On axioms for commutative regular equations without addition. (Q1853544) (← links)
- On equations for union-free regular languages (Q1854402) (← links)
- Equational theories for automata (Q2074221) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- An Equational Axiomatization of Bisimulation over Regular Expressions (Q4542240) (← links)