Automata and Languages: Theory and Applications
Autor Alexander Medunaen Limba Engleză Paperback – 17 iul 2000
Preț: 679.79 lei
Preț vechi: 849.73 lei
-20% Nou
Puncte Express: 1020
Preț estimativ în valută:
130.09€ • 135.65$ • 108.12£
130.09€ • 135.65$ • 108.12£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781852330743
ISBN-10: 1852330740
Pagini: 952
Ilustrații: XVI, 920 p. 32 illus.
Dimensiuni: 155 x 235 x 50 mm
Greutate: 1.36 kg
Ediția:2000
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom
ISBN-10: 1852330740
Pagini: 952
Ilustrații: XVI, 920 p. 32 illus.
Dimensiuni: 155 x 235 x 50 mm
Greutate: 1.36 kg
Ediția:2000
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
INTRODUCTION: Languages. Formalization of Languages. Expressions and Grammars. Translations. Exercises, Programming Projects. Automata. Conceptualization of Automata. Transducers. Computability. Exercises. Programming Projects. Bibliographic Notes.- REGULAR LANGUAGES: Models for Regular Languages. Regular Expressions. Finite Automata. Finite Automata and Regular Expressions. Exercises. Programming Projects. Properties of Regular Languages. Pumping Lemma. Closure Properties. Decidable Problems. Exercises.- CONTEXT-FREE LANGUAGES: Models for Context-Free Languages. Context-Free Grammars. Pushdown Automata. Pushdown Autmata and Context-Free Grammars. Exercises. Programming Projects. Properties of Context-Free Languages. Pumping Lemma. Closure Properties. Decidable Problems. Exercises. Special Types of Context-Free Languages and Their Models. Deterministic Context-Free Languages. Linear and Regular Grammars. Exercises.- BEYOND CONTEXT-FREE LANGUAGES: Generalized Models. Turing Machines. Two-Pushdown Automata. Unrestricted Grammars. A Hierarchy of Language Families. Exercises. Programming Projects. Bibliographic Notes.- TRANSLATIONS: Finite and Pushdown Transducers. Finite Transducers. Translation Grammars and Pushdown Transducers. Compilers. Exercises. Programming Projects. Turing Transducers. Basic Definitions. Computability. Decidability. Exercises. Programming Projects.- Bibliographic Notes.- Appendix - Mathematical Background.- Bibliography.- Indices.- Index to Special Symbols.- Index to Decision Problems.- Index to Algorithms.- Subject Index.
Caracteristici
PRESENTS AN INTRODUCTION TO FUNDAMENTAL ABSTRACT MODELS BEHIND COMPUTATION IN A CLEAR, SIMPLE AND RIGOROUS WAY. Includes supplementary material: sn.pub/extras