Regulated pushdown automata

Authors

  • Alexander Meduna
  • Dusan Kolar

Abstract

The present paper suggests a new investigation area of the formal language theory — regulated automata. Specifically, it investigates pushdown automata that regulate the use of their rules by control languages. It proves that this regulation has no effect on the power of pushdown automata if the control languages are regular. However, the pushdown automata regulated by linear control languages characterize the family of recursively enumerable languages. All these results are established in terms of (A) acceptance by final state, (B) acceptance by empty pushdown, and (C) acceptance by final state and empty pushdown. In its conclusion, this paper formulates several open problems.

Downloads

Download data is not yet available.

Downloads

Published

2000-01-01

How to Cite

Meduna, A., & Kolar, D. (2000). Regulated pushdown automata. Acta Cybernetica, 14(4), 653–664. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3557

Issue

Section

Regular articles