Automata and Languages presents a step-by-step development of the theory
of automata, languages and computation. Intended to be used as the basis
of an introductory course to this theory at both junior and senior levels,
the text is organized in such a way as to allow the design of various
courses based on selected material.
Areas featured in the book include:-
* basic models of computation
* formal languages and their properties
* computability, decidability and complexity
* a discussion of the modern trends in the theory of automata and
formal languages
* design of programming languages, including the development of a new
programming language
* compiler design, including the construction of a complete compiler
Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful
examples to make formerly obscure concepts easy to understand. He also
includes challenging exercises and programming projects to enhance the
reader's comprehension, and, to put the theory firmly into a 'real world'
context, he presents lots of realistic illustrations and applications in
practical computer science.
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
32
32 s/w Abbildungen
XVI, 920 p. 32 illus.
Dateigröße
ISBN-13
978-1-4471-0501-5 (9781447105015)
DOI
10.1007/978-1-4471-0501-5
Schweitzer Klassifikation
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.
