3 citations · 8 across the 9 of their papers we have counts for
1 paper · 1 filter
Lukas Fleischer, Jeffrey Shallit
Given a regular language L over an ordered alphabet Σ, the set of lexicographically smallest (resp., largest) words of each length is itself regular. Moreover, there exists an un…