Cargando…
Transition Property for [Formula: see text]-Power Free Languages with [Formula: see text] and [Formula: see text] Letters
In 1985, Restivo and Salemi presented a list of five problems concerning power free languages. Problem 4 states: Given [Formula: see text]-power-free words u and v, decide whether there is a transition from u to v. Problem 5 states: Given [Formula: see text]-power-free words u and v, find a transiti...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247872/ http://dx.doi.org/10.1007/978-3-030-48516-0_22 |