| aX | The Alexandrov compactification of X
|
| A | An alphabet
|
| A* | The free semigroup of all finitary strings over A
|
| bX | The Stone-Cech compactification of X
|
| F | A finite state recogniser
|
| |F| | The (regular) language recognised by F
|
| FL | The X-machine with finite state core F and labelling L
|
| L | A language
|
| LL | The relation computed by the (regular) language L via the labelling L
|
| L | A labelling, i.e., a function L: A ----> RelX
|
| |L| | The subset of RelX computed by L
|
| M | An X-machine
|
| M0 | The finite state core of M
|
| |M| | The relation computed by M
|
| RelX | The semigroup 2X×X of all relations on X
|
| X | The fundamental
datatype |