Alexander Meduna

Automata and Languages

Theory and Applications

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Verlag: Springer / Springer London / Springer, Berlin
• Artikelnr. des Verlages: 978-1-85233-074-3
• 2000.
• Seitenzahl: 952
• Erscheinungstermin: 17. Juli 2000
• Englisch
• Abmessung: 235mm x 155mm x 52mm
• Gewicht: 1382g
• ISBN-13: 9781852330743
• ISBN-10: 1852330740
• Artikelnr.: 08534302

Autorenporträt

Alexander Meduna, Associate Professor of Computer Science at the Brno University of Technology, received his PhD from Brno University in 1988. He has taught theoretical computer science at various European and American universities, including the University of Missouri, where he spent a decade teaching advanced topics of formal language theory.

Inhaltsangabe

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.