KI-Beratung Beta

  • Produktbild: Automata and Languages
  • Produktbild: Automata and Languages
- 10%

Automata and Languages Theory and Applications

10% sparen

95,99 € UVP 106,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

17.07.2000

Abbildungen

XVI, 920 p. 32 illus.

Verlag

Springer London

Seitenzahl

920

Maße (L/B/H)

23,5/15,5/5,2 cm

Gewicht

1430 g

Auflage

2000

Sprache

Englisch

ISBN

978-1-85233-074-3

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

17.07.2000

Abbildungen

XVI, 920 p. 32 illus.

Verlag

Springer London

Seitenzahl

920

Maße (L/B/H)

23,5/15,5/5,2 cm

Gewicht

1430 g

Auflage

2000

Sprache

Englisch

ISBN

978-1-85233-074-3

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Automata and Languages
  • Produktbild: Automata and Languages
  • 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.