| Autor: |
Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler |
| Jazyk: |
angličtina |
| Rok vydání: |
2010 |
| Předmět: |
|
| Zdroj: |
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 48-57 (2010) |
| Druh dokumentu: |
article |
| ISSN: |
2075-2180 |
| DOI: |
10.4204/EPTCS.31.7 |
| Popis: |
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy representations of the multiples of m in the Fibonacci system is exactly 2m^2. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
