The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Previous Page 3

Displaying 41 – 44 of 44

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 41 – 44 of 44

Previous Page 3