Detail publikačního výsledku

Finitely Expandable Deep PDAs

MEDUNA, A.

Originální název

Finitely Expandable Deep PDAs

Anglický název

Finitely Expandable Deep PDAs

Druh

Kapitola, resp. kapitoly v odborné knize

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

deep PDAs

Klíčová slova v angličtině

deep PDAs

Autoři

MEDUNA, A.

Rok RIV

2012

Vydáno

22.03.2010

Nakladatel

Hong Kong University of Scinece and Technology

Místo

Hong Kong

ISBN

981-4317-60-8

Kniha

Automata, Formal Languages and Algebraic Systems

Strany od

113

Strany do

123

Strany počet

10

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"
}