๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On complexity reduction of concept lattices: three counterexamples

โœ Scribed by Michal Krupka

Book ID
113067637
Publisher
Springer Netherlands
Year
2011
Tongue
English
Weight
407 KB
Volume
15
Category
Article
ISSN
1386-4564

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The complexity of functions on lattices
The complexity of functions on lattices
โœ J.W. Sander; R. Tijdeman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 212 KB

Let f : Z โ†’ {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x โˆˆ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with