Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
295,00 €*
Versandkostenfrei per Post / DHL
Aktuell nicht verfügbar
Kategorien:
Beschreibung
Noch keine Beschreibung vorhanden. Sollten Sie Fragen zu dem Artikel haben, helfen wir Ihnen gerne weiter.
Inhaltsverzeichnis
AUTOMATA THEORY.
Background.
Languages.
Recursive Definitions.
Regular Expressions.
Finite Automata.
Transition Graphs.
Kleene's Theorem.
Finite Automata with Output.
Regular Languages.
Nonregular Languages.
Decidability.
PUSHDOWN AUTOMATA THEORY.
Context-Free Grammars.
Grammatical Format.
Pushdown Automata.
CFG = PDA.
Non-Context-Free Languages.
Context-Free Languages.
Decidability.
TURING THEORY.
Turing Machines.
Post Machines.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.
Background.
Languages.
Recursive Definitions.
Regular Expressions.
Finite Automata.
Transition Graphs.
Kleene's Theorem.
Finite Automata with Output.
Regular Languages.
Nonregular Languages.
Decidability.
PUSHDOWN AUTOMATA THEORY.
Context-Free Grammars.
Grammatical Format.
Pushdown Automata.
CFG = PDA.
Non-Context-Free Languages.
Context-Free Languages.
Decidability.
TURING THEORY.
Turing Machines.
Post Machines.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.
Details
| Erscheinungsjahr: | 1996 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: |
XIV
634 S. |
| ISBN-13: | 9780471137726 |
| ISBN-10: | 0471137723 |
| Sprache: | Englisch |
| Herstellernummer: | 14613772000 |
| Autor: | Cohen, Daniel I. A. |
| Auflage: | 2. Aufl. |
| Hersteller: | Wiley & Sons |
| Abbildungen: | w. figs. |
| Von/Mit: | Daniel I. A. Cohen |
| Erscheinungsdatum: | 27.11.1996 |
| Gewicht: | 1,198 kg |
Inhaltsverzeichnis
AUTOMATA THEORY.
Background.
Languages.
Recursive Definitions.
Regular Expressions.
Finite Automata.
Transition Graphs.
Kleene's Theorem.
Finite Automata with Output.
Regular Languages.
Nonregular Languages.
Decidability.
PUSHDOWN AUTOMATA THEORY.
Context-Free Grammars.
Grammatical Format.
Pushdown Automata.
CFG = PDA.
Non-Context-Free Languages.
Context-Free Languages.
Decidability.
TURING THEORY.
Turing Machines.
Post Machines.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.
Background.
Languages.
Recursive Definitions.
Regular Expressions.
Finite Automata.
Transition Graphs.
Kleene's Theorem.
Finite Automata with Output.
Regular Languages.
Nonregular Languages.
Decidability.
PUSHDOWN AUTOMATA THEORY.
Context-Free Grammars.
Grammatical Format.
Pushdown Automata.
CFG = PDA.
Non-Context-Free Languages.
Context-Free Languages.
Decidability.
TURING THEORY.
Turing Machines.
Post Machines.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.
Details
| Erscheinungsjahr: | 1996 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: |
XIV
634 S. |
| ISBN-13: | 9780471137726 |
| ISBN-10: | 0471137723 |
| Sprache: | Englisch |
| Herstellernummer: | 14613772000 |
| Autor: | Cohen, Daniel I. A. |
| Auflage: | 2. Aufl. |
| Hersteller: | Wiley & Sons |
| Abbildungen: | w. figs. |
| Von/Mit: | Daniel I. A. Cohen |
| Erscheinungsdatum: | 27.11.1996 |
| Gewicht: | 1,198 kg |
Warnhinweis