On the index of Simon's congruence for piecewise testability
© 2014 Elsevier B.V. Simon's congruence, denoted by ∼ 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 Θ (n k-1 lognθ).
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Article |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/31967 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|