Regulated Rewriting in Formal Language Theory: Monographs in Theoretical Computer Science. An EATCS Series, cartea 18
Autor Jürgen Dassow, Gheorghe Paunen Limba Engleză Paperback – 13 dec 2011
Din seria Monographs in Theoretical Computer Science. An EATCS Series
- 20% Preț: 656.49 lei
- 20% Preț: 624.06 lei
- 20% Preț: 329.43 lei
- 20% Preț: 632.66 lei
- 20% Preț: 635.09 lei
- 20% Preț: 332.69 lei
- 20% Preț: 896.93 lei
- 20% Preț: 583.40 lei
- 20% Preț: 529.97 lei
- 20% Preț: 637.34 lei
- 20% Preț: 647.89 lei
- 20% Preț: 635.90 lei
- 20% Preț: 1434.04 lei
- 20% Preț: 651.78 lei
- 20% Preț: 324.07 lei
- 20% Preț: 327.37 lei
- 18% Preț: 933.22 lei
- 20% Preț: 758.19 lei
- 20% Preț: 812.68 lei
- 20% Preț: 998.39 lei
- 20% Preț: 977.49 lei
- 15% Preț: 633.95 lei
- 20% Preț: 632.48 lei
- 20% Preț: 976.65 lei
- 20% Preț: 632.33 lei
- 20% Preț: 635.73 lei
- 20% Preț: 634.26 lei
- 20% Preț: 626.00 lei
- 20% Preț: 511.90 lei
- 20% Preț: 605.80 lei
Preț: 637.52 lei
Preț vechi: 796.90 lei
-20% Nou
Puncte Express: 956
Preț estimativ în valută:
122.05€ • 126.86$ • 101.19£
122.05€ • 126.86$ • 101.19£
Carte tipărită la comandă
Livrare economică 08-22 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642749346
ISBN-10: 3642749348
Pagini: 312
Ilustrații: 308 p.
Dimensiuni: 170 x 242 x 16 mm
Greutate: 0.5 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642749348
Pagini: 312
Ilustrații: 308 p.
Dimensiuni: 170 x 242 x 16 mm
Greutate: 0.5 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
0. Introduction.- 0.1. Languages and Language Families.- 0.2. Language Generating Devices.- 0.3. Algorithms and Decidability.- 0.4. Seven Circumstances Where Context-Free Grammars Are Not Enough.- 1. Three Types of Regulation: Matrix, Programmed, and Random Context Grammars.- 1.1. Definitions and Examples.- 1.2. The Generative Capacity.- 1.3. Fundamental Properties.- 1.4. Leftmost Derivations.- 1.5. Special Cases.- 2. Other Grammars with Regulation.- 2.1. Prescribed Sequences.- 2.2. Dependence on Previous Productions.- 2.3. Context Conditions.- 2.4. Further Regulated Devices.- 2.5. Conclusions.- 3. Grammars of Finite Index.- 3.1. The Generative Power of Finite Index Grammars.- 3.2. Properties of Grammars and Languages of Finite Index.- 4. The Syntactic Complexity of Regulated Rewriting.- 4.1. Nonterminal Complexity. Comparison.- 4.2. Nonterminal Complexity. Families of Languages with Bounded Complexity.- 4.3. Further Complexity Measures.- 5. Pure Regulated Grammars and Languages and Their Codings.- 5.1. Hierarchy of Pure Regulated Languages.- 5.2. Codings of Pure Languages.- 6. Combined Regulations.- 6.1. Indian and Russian Parallel Versions of Regulated Grammars.- 6.2. Ordered Versions of Regulated Rewriting.- 6.3. Random Context Versions of Regulated Grammars.- 7. Some Special Problems.- 7.1. Automata Characterizations.- 7.2. Szilard Language of Regulated Grammars.- 7.3. Grammar Forms.- 8. Regulated L Systems.- 9. Applications of Regulated Rewritting.- 9.1. Relationships with Programming Languages.- 9.2. Regulated Rewritting and Petri Nets.- 9.3. Modelling of Economic Processes.- 9.4. Modelling Folklore Fairy-Tales, Dramatic, Musical and Visual Art Works.- 9.5. The Mappings Investigation.- 10. A Common Generalization: Selective Substitution Grammars.- Notation Index.-Author Index.