ROMJIST Volume 21, No. 3, 2018, pp. 232-237
L. Charvat, A. Meduna Internally Expandable Pushdown Automata and Their Computational Completeness
ABSTRACT: The present paper defines the notion of an internally expandable pushdown automaton (IEPDA). In essence, this automaton expands the topmost expandable non-input symbol in its pushdown list. This expanded symbol, however, may not occur on the very top of the pushdown; instead, it may appear deeper in the pushdown. The paper demonstrates that this notion represents an automaton-based counter part to the notion of a state grammar. Indeed, both are equally powerful. Therefore, internally expandable pushdown automata are computationally complete--that is, they are as powerful as Turing machines. In fact there are computationally complete IEPDAs with no more than four statesKEYWORDS: -Read full text (pdf)
