Publication detail

Regulated Nondeterminism in PDAs: The Non-Regular Case

MASOPUST, T.

Original Title

Regulated Nondeterminism in PDAs: The Non-Regular Case

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

Pushdown automata, regulation, computational power, descriptional complexity.

Authors

MASOPUST, T.

RIV year

2009

Released

6. 7. 2009

Publisher

Austrian Computer Society

Location

Wroclaw

ISBN

978-3-85403-256-4

Book

Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA)

Edition

books@ocg.at Band 256

Pages from

181

Pages to

194

Pages count

14

BibTex

@inproceedings{BUT33731,
  author="Tomáš {Masopust}",
  title="Regulated Nondeterminism in PDAs: The Non-Regular Case",
  booktitle="Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA)",
  year="2009",
  series="books@ocg.at Band 256",
  pages="181--194",
  publisher="Austrian Computer Society",
  address="Wroclaw",
  isbn="978-3-85403-256-4"
}