Page 1

Displaying 1 – 3 of 3

Showing per page

The completely distributive lattice of machine invariant sets of infinite words

Aleksandrs Belovs, Jānis Buls (2007)

Discussiones Mathematicae - General Algebra and Applications

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. The length and width of it is c. We show the subword complexity and the growth function create machine invariant classes.

Currently displaying 1 – 3 of 3

Page 1