Affiliation:
1. Institut für Informatik, Universität Giessen, Arndtstr. 2, D-35392 Giessen, Germany
Abstract
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strongly Limited Automata;Fundamenta Informaticae;2016-12-24
2. A TAXONOMY OF DETERMINISTIC FORGETTING AUTOMATA;International Journal of Foundations of Computer Science;2010-08
3. A Taxonomy of Deterministic Forgetting Automata;Developments in Language Theory