Combinatorics On Words

← Back to Domain-Specific Abstractions by Domain

1 domain-specific abstractions whose origin domain is Combinatorics On Words.

• Factor Complexity Function — The length-indexed count of distinct contiguous factors in a finite or infinite word—equivalently the density function of its factor language—whose growth separates periodicity, low-complexity aperiodicity, and entropy-bearing pattern diversity.