Cargando…
The State Complexity of Lexicographically Smallest Words and Computing Successors
Given a regular language L over an ordered alphabet [Formula: see text], the set of lexicographically smallest (resp., largest) words of each length is itself regular. Moreover, there exists an unambiguous finite-state transducer that, on a given word [Formula: see text], outputs the length-lexicogr...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247871/ http://dx.doi.org/10.1007/978-3-030-48516-0_7 |