Algebra, Automata, and Computation
Traditionally, from an algebraic viewpoint, automata work over free monoids. The present chapter, however, modifies this standard approach so they work over other algebraic structures. More specifically, this chapter discusses a modification of pushdown automata that is based on two-sided pushdowns into which symbols are pushed from both ends.
- [ABB97]J. Autebert, J. Berstel, L. Boasson, (eds.), Context-Free Languages and Pushdown Automata, in Handbook of Formal Languages, chapter 3 (Springer, Berlin, 1997), pp. 111–174Google Scholar
- [Sar01]P. Sarkar, Pushdown automaton with the ability to flip its stack, in TR01-081, Electronic Colloquium on Computational Complexity (ECCC), 2001Google Scholar