FORGETTING AUTOMATA AND UNARY LANGUAGES
Jens Glöckler · International Journal of Foundations of Computer Science · 2007
We consider forgetting automata, i.e., linear bounded automata which can only use the operations "move", "erase" (rewrite with a blank symbol) and "delete" (remove completely). A classification of the families of languages corresponding to the possible combinations of operations has been given in [1], here we address some of the problems left open. Furthermore the unary case is being investigated.