Automata and Languages
Autor Alexander Medunaen Limba Engleză Paperback – 17 iul 2000
Preț: 658.46 lei
Preț vechi: 823.08 lei
-20%
Puncte Express: 988
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9781852330743
ISBN-10: 1852330740
Pagini: 952
Ilustrații: XVI, 920 p. 32 illus.
Dimensiuni: 155 x 235 x 52 mm
Greutate: 1.43 kg
Ediția:2000
Editura: Springer
Locul publicării:London, United Kingdom
ISBN-10: 1852330740
Pagini: 952
Ilustrații: XVI, 920 p. 32 illus.
Dimensiuni: 155 x 235 x 52 mm
Greutate: 1.43 kg
Ediția:2000
Editura: 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