Conference paper
Authors list: Gloeckler, Jens
Publication year: 2010
Pages: 619-631
Journal: International Journal of Foundations of Computer Science
Volume number: 21
Issue number: 4
ISSN: 0129-0541
DOI Link: https://doi.org/10.1142/S0129054110007453
Conference: 12th International Conference on Developments in Language Theory
Publisher: World Scientific Publishing
Abstract:
We investigate deterministic forgetting automata, i.e., deterministic linear bounded automata which can only use the operations 'move', 'erase' (rewrite with a blank symbol) and 'delete' (remove completely). We give a taxonomy of deterministic forgetting automata and draw comparisons to other kinds of automata (namely deterministic one-turn pushdown automata and one-way one-counter automata).
Citation Styles
Harvard Citation style: Gloeckler, J. (2010) A TAXONOMY OF DETERMINISTIC FORGETTING AUTOMATA, International Journal of Foundations of Computer Science, 21(4), pp. 619-631. https://doi.org/10.1142/S0129054110007453
APA Citation style: Gloeckler, J. (2010). A TAXONOMY OF DETERMINISTIC FORGETTING AUTOMATA. International Journal of Foundations of Computer Science. 21(4), 619-631. https://doi.org/10.1142/S0129054110007453
Keywords
counter automata; deterministic context-free languages; deterministic linear languages; forgetting automata; LANGUAGES
