Unusual algorithms for lexicographical enumeration
Pál Dömösi · 2000
Using well-known results, we show that one can effectively construct algorithms related to the lexicographical order with surprisingly low time complexity. In particular, we consider algorithms for finding minimal words of given length in regular and context-free languages running in O(c) time when