Konferenzpaper

Jahr der Veröffentlichung: 2007

Seiten: 813-827

Zeitschrift: International Journal of Foundations of Computer Science

Bandnummer: 18

Heftnummer: 4

ISSN: 0129-0541

DOI Link: https://doi.org/10.1142/S0129054107004991

Konferenz: 11th International Conference on Implementation and Application of Automata

Verlag: World Scientific Publishing

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.

Harvard-Zitierstil: Gloeckler, J. (2007) Forgetting automata and unary languages, International Journal of Foundations of Computer Science, 18(4), pp. 813-827. https://doi.org/10.1142/S0129054107004991

APA-Zitierstil: Gloeckler, J. (2007). Forgetting automata and unary languages. International Journal of Foundations of Computer Science. 18(4), 813-827. https://doi.org/10.1142/S0129054107004991