Computation and automata
Formal languages
Grammars with controlled derivations
Handbook of formal languages, vol. 2
Homomorphic characterizations of recursively enumerable languages with very small language classes
Theoretical Computer Science
Acta Cybernetica
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
One-Turn Regulated Pushdown Automata and Their Reduction
Fundamenta Informaticae
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
We continue the investigation of pushdown automata which are allowed to make a non-deterministic decision if and only if their pushdown content forms a string belonging to a given control language. We prove that if the control language is linear and non-regular, then the power of pushdown automata regulated in this way is increased to the power of Turing machines. From a practical point of view, however, it is inefficient to check the form of the pushdown content in each computational step. Therefore, we prove that only two checks of the pushdown content are of interest for these machines to be computationally complete. Based on this observation, we introduce and discuss a new model of regulated pushdown automata.