Conference paper

Editor list: Ibarra, OH; Yen, HC

Publication year: 2006

Pages: 186-197

Journal: Lecture notes in computer science

Volume number: 4094

ISSN: 0302-9743

ISBN: 3-540-37213-X

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

Publisher: Springer

Title of series: LECTURE NOTES IN COMPUTER SCIENCE

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 Citation style: Gloeckler, J. (2006) Forgetting automata and unary languages, Lecture notes in computer science (Schriftenreihe), 4094, pp. 186-197

APA Citation style: Gloeckler, J. (2006). Forgetting automata and unary languages. Lecture notes in computer science (Schriftenreihe). 4094, 186-197.