Publication Details

Finitely Expandable Deep PDAs

MEDUNA, A. Finitely Expandable Deep PDAs. In Automata, Formal Languages and Algebraic Systems. Hong Kong: Hong Kong University of Scinece and Technology, 2010. p. 113-123. ISBN: 981-4317-60-8.
Czech title
Hluboké zásobníkové automaty s konečnými expanzemi
Type
book chapter
Language
English
Authors
Meduna Alexandr, prof. RNDr., CSc. (DIFS)
Keywords

deep PDAs

Abstract

By finitely expandable deep PDAs, this book refers to any PDAs extended by additional mathematical mechanisms that prescribe the use of rules during the generation of their languages. The book pays a special attention to these six crucially important regulated grammars---regular-controlled grammars, matrix grammars, programmed grammars, random context grammars, scattered context grammars, and state grammars. More specifically, it primarily discusses algorithms that transform these grammars as well as some related regulated language-defining devices, such as regulated grammar systems and pushdown automata, so they satisfy some prescribed desirable properties while the generated languages remain unchanged. It also explains practical and theoretical significance of these transformations. In its conclusion, the book summarizes the main results of the entire book and put them into the context of formal language theory as a whole; in addition, it makes several bibliographical and historical remarks.

Published
2010
Pages
113–123
Book
Automata, Formal Languages and Algebraic Systems
ISBN
981-4317-60-8
Publisher
Hong Kong University of Scinece and Technology
Place
Hong Kong
BibTeX 
@inbook{BUT76298,
  author="Alexandr {Meduna}",
  title="Finitely Expandable Deep PDAs",
  booktitle="Automata, Formal Languages and Algebraic Systems",
  year="2010",
  publisher="Hong Kong University of Scinece and Technology",
  address="Hong Kong",
  pages="113--123",
  isbn="981-4317-60-8"
}
Back to top