10 citations · 28 across the 10 of their papers we have counts for
3 papers · 1 filter
Once-Marking and Always-Marking 1-Limited Automata
Giovanni Pighizzini, Luca Prigioniero
Single-tape nondeterministic Turing machines that are allowed to replace the symbol in each tape cell only when it is scanned for the first time are also known as 1-limited automat…
Forgetting 1-Limited Automata
Giovanni Pighizzini, Luca Prigioniero
We introduce and investigate forgetting 1-limited automata, which are single-tape Turing machines that, when visiting a cell for the first time, replace the input symbol in it by a…
Magic numbers in periodic sequences
Savinien Kreczman, Luca Prigioniero, Eric Rowland +1
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 t…