Kreczman, Savinien and Prigioniero, Luca and Rowland, Eric and Stipulanti, Manon
(2023)
*Magic Numbers In Periodic Sequences.*
Eric.
pp. 2-19.

PDF
Download (298kB) |

## Abstract

In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n, 2n] such that there is no minimal deterministic finite automaton with d states that can be simulated by a minimal nondeterministic finite automaton with exactly n states? If such a number d exists, it is called magic. In this paper, we consider the magic number problem in the framework of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | 1. Magic numbers 2. Periodic sequences 3. Automatic sequences 4. Regular sequences 5. Constant recursive sequences |

Subjects: | H Social Sciences > HA Statistics Q Science > QA Mathematics Q Science > QD Chemistry |

Divisions: | Faculty of Engineering, Science and Mathematics > School of Mathematics |

Depositing User: | nwokealisi |

Date Deposited: | 08 Feb 2024 13:53 |

Last Modified: | 08 Feb 2024 13:53 |

URI: | http://eprints.covenantuniversity.edu.ng/id/eprint/17752 |

### Actions (login required)

View Item |