Magic numbers in periodic sequences

by   Savinien Kreczman, et al.
Hofstra University
Università degli Studi di Milano

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,2^n] such that there is no minimal deterministic finite automaton with d states that can be simulated by an optimal 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.


page 1

page 2

page 3

page 4


Frobenius Numbers and Automatic Sequences

The Frobenius number g(S) of a set S of non-negative integers with 1 is ...

A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton

Unambiguous non-deterministic finite automata have intermediate expressi...

Automatic sequences: from rational bases to trees

The nth term of an automatic sequence is the output of a deterministic f...

Decidability and k-Regular Sequences

In this paper we consider a number of natural decision problems involvin...

Automata and automatic sequences

In the following pages we discuss infinite sequences defined on a finite...

Word-Mappings of level 3

Sequences of numbers (either natural integers, or integers or rational) ...

Some D-finite and Some Possibly D-finite Sequences in the OEIS

In an automatic search, we found conjectural recurrences for some sequen...

Please sign up or login with your details

Forgot password? Click here to reset