Regulated Rewriting in Formal Language Theory (Monographs in Theoretical Computer Science. An EATCS Series)
Product details
| Management number | 236848258 | Release Date | 2026/07/10 | List Price | US$37.21 | Model Number | 236848258 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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. Read more
| ISBN10 | 3540514147 |
|---|---|
| ISBN13 | 978-3540514145 |
| Edition | 1st |
| Language | English |
| Publisher | Springer |
| Item Weight | 1.42 pounds |
| Print length | 308 pages |
| Publication date | April 6, 1990 |
Bestseller ranking
Logic
Customers who viewed this product also viewed
Spatulas
Correction of product information
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form