A Taxonomy of Deterministic Forgetting Automata

Authors:
Jens Glöckler
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany 35392
Venue:
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Year:
2008

Citing 5
Cited 0

Introduction to Formal Language Theory

Introduction to Formal Language Theory
Characterization of Context-Free Languages by Erasing Automata

MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
A Taxonomy of Forgetting Automata

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Finite-Change Automata

Proceedings of the 4th GI-Conference on Theoretical Computer Science
On the Complexities of Linear LL(1) and LR(1) Grammars

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

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).