The Lattice of Machine Invariant Sets and Subword Complexity
<|reference_start|>The Lattice of Machine Invariant Sets and Subword Complexity: We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the lattice would serve as a measure of words cryptographic quality if we like to identify new stream ciphers suitable for widespread adoption.<|reference_end|>
@article{buls2005the,
    title={The Lattice of Machine Invariant Sets and Subword Complexity},
    author={Janis Buls},
    journal={arXiv preprint arXiv:cs/0502064},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0502064},
    primaryClass={cs.CR cs.CC cs.DM}
}