Detail publikace

Regulated Grammars and Their Transformations

Originální název

Regulated Grammars and Their Transformations

Anglický název

Regulated Grammars and Their Transformations

Jazyk

en

Originální abstrakt

By regulated grammars, this book refers to any context-free grammars 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 regulated grammars, this book refers to any context-free grammars 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.

BibTex


@book{BUT62062,
  author="Alexandr {Meduna} and Petr {Zemek}",
  title="Regulated Grammars and Their Transformations",
  annote="By regulated grammars, this book refers to any context-free grammars 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.",
  address="Brno University of Technology",
  chapter="62062",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Brno University of Technology",
  year="2010",
  month="december",
  pages="0--0",
  publisher="Brno University of Technology",
  type="book"
}