Detail publikace

Regulated Nondeterminism in PDAs: The Non-Regular Case

Originální název

Regulated Nondeterminism in PDAs: The Non-Regular Case

Anglický název

Regulated Nondeterminism in PDAs: The Non-Regular Case

Jazyk

en

Originální abstrakt

In this paper, we discuss pushdown automata which can make a nondeterministic decision only if the pushdown content forms a string that belongs to a given control language. It proves that if the control language is linear and non-regular, then the computational power of pushdown automata regulated in this way is increased to the power of Turing machines. Naturally, checking the pushdown content in each computational step is not practically efficient. Therefore, we also prove that two checks of the form of the pushdown content during any computation are sufficient for these automata to be computationally complete. Finally, some descriptional complexity results are discussed.

Anglický abstrakt

In this paper, we discuss pushdown automata which can make a nondeterministic decision only if the pushdown content forms a string that belongs to a given control language. It proves that if the control language is linear and non-regular, then the computational power of pushdown automata regulated in this way is increased to the power of Turing machines. Naturally, checking the pushdown content in each computational step is not practically efficient. Therefore, we also prove that two checks of the form of the pushdown content during any computation are sufficient for these automata to be computationally complete. Finally, some descriptional complexity results are discussed.

BibTex


@inproceedings{BUT33731,
  author="Tomáš {Masopust}",
  title="Regulated Nondeterminism in PDAs: The Non-Regular Case",
  annote="In this paper, we discuss pushdown automata which can make a nondeterministic
decision only if the pushdown content forms a string that belongs to a given
control language. It proves that if the control language is linear and
non-regular, then the computational power of pushdown automata regulated in this
way is increased to the power of Turing machines. Naturally, checking the
pushdown content in each computational step is not practically efficient.
Therefore, we also prove that two checks of the form of the pushdown content
during any computation are sufficient for these automata to be computationally
complete. Finally, some descriptional complexity results are discussed.",
  address="Austrian Computer Society",
  booktitle="Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA)",
  chapter="33731",
  edition="books@ocg.at Band 256",
  howpublished="print",
  institution="Austrian Computer Society",
  year="2009",
  month="july",
  pages="181--194",
  publisher="Austrian Computer Society",
  type="conference paper"
}