Meduna | Automata and Languages | E-Book | sack.de
E-Book

E-Book, Englisch, 920 Seiten, eBook

Meduna Automata and Languages

Theory and Applications
Erscheinungsjahr 2012
ISBN: 978-1-4471-0501-5
Verlag: Springer
Format: PDF
 Kopierschutz: 1 - PDF Watermark

Theory and Applications

E-Book, Englisch, 920 Seiten, eBook

ISBN: 978-1-4471-0501-5
Verlag: Springer
Format: PDF
 Kopierschutz: 1 - PDF Watermark

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.

Meduna Automata and Languages jetzt bestellen!

Zielgruppe

Research

Autoren/Hrsg.

Meduna, Alexander

Weitere Infos & Material

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.

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.