Regulated rewriting in formal language theory
著者
書誌事項
Regulated rewriting in formal language theory
（EATCS monographs on theoretical computer science, v. 18）
Springer-Verlag, c1989
- : US
- : gw
大学図書館所蔵 全38件
注記
Includes bibliographical references and indexes
内容説明・目次
内容説明
It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related fields. Therefore a lot of mechanisms have been introduced which control the application of context-free rules. This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies. Matrix, programmed, and random context grammars as typical representants are studied in more detail. Besides their algebraic and decidability properties a comparison is made with respect to syntactic complexity measures and pure versions. Further topics are combinations of some control mechanisms, regulated L systems, automata characterizations, Szilard languages, and grammar forms of regulated grammars as well as selective substitution grammars as one common generalization.
「Nielsen BookData」 より