2000 character limit reached
On the index of Simon's congruence for piecewise testability
Published 3 Oct 2013 in cs.FL, cs.DM, and math.CO | (1310.1278v5)
Abstract: Simon's congruence, denoted \sim_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 \sim_n is in 2{\Theta(n{k-1} log n)}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.