On the index of Simon's congruence for piecewise testability
Abstract
Simon's congruence, denoted n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo n is in 2(nk-1 log n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.