Universal Theory of Automata

A Categorical Approach

AvH. Ehrig,K.-D. Kiermeier

Häftad, Tyska, 1974

Del i serien XTeubner Studienbücher Informatik

468 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1974-10-01
Mått:148 x 210 x 14 mm
Vikt:321 g
Format:Häftad
Språk:Tyska
Serie:XTeubner Studienbücher Informatik
Antal sidor:240
Upplaga:1974
Förlag:Springer Fachmedien Wiesbaden
ISBN:9783519020547

Utforska kategorier

Innehållsförteckning

1. Unified Representation of Automata.- deterministic, nondeterministic, stochastic, linear, bilinear, and topological automata (1.1–1.7); monoidal categories (1.8–1.10); automata in monoidal categories (1.11–1.14).- 2. Some Problems in Automata Theory.- behavior, reduction, minimization and realization of deterministic automata (2.1–2.6); nondeterministic automata (2.7); transition monoids (2.8); structure theory (2.9).- 3. General Concepts of Reduction, Minimization and Realization.- concept of systematics (3.1); reduced, minimal and realizing systems and subsystematics (3.2–3.3); reduction theorem (3.4); minimal realization theorem (3.6).- 4. Behavior of Automata in Closed Categories: The Deterministic Case.- extended output morphisms and coproducts (4.2); machine morphisms and closed categories (4.3–4.4); characterization of automata (4.5); behavior and image-factorization (4.6–4.7); behavior characterization (4.8); list of examples (4.9).- 5. Reduction and Minimization of Automata in Closed Categories.- systematic of automata in closed categories (5.2); minimal realization theorem (5.3); observable and reduced automata (5.4); reduction and minimization theorem (5.5); monoid automata and transition monoids (5.6–5.7).- 6. Behavior of Automata in Pseudoclosed Categories: The Nondeterministic Case.- automata in pseudoclosed categories — extended output, machine morphism and behavior (6.2–6.4); characterization of machine morphisms and behaviors (6.6–6.7); list of examples (6.8).- 7. Reduction and Minimization of Automata in Pseudoclosed Categories.- construction of reduced and observable automata (7.2–7.4); realization (7.5); systematic of automata in pseudoclosed categories (7.6); reduction theorem (7.7); minimization theorem (7.8); strongminimality (7.9).- 8. Power Automata.- construction of power automata (8.2); power automata theorem (8.3–8.4); kernel automata (8.5).- 9. Initial Automata.- systematic of initial automata (9.2); free realization (9.3); minimal realization theorem (9.5); reachability theorem (9.7); reduction and observability construction (9.8–9.9); observable and finite realization (9.10); initial power automata (9.11).- 10. Scoop Minimization.- scoops and scoop automata theorem (10.2–10.4); scoop construction (10.5–10.7); scoop minimization theorem (10.8).- 11. Structure Theory of Automata.- construction of equalizer, product, coequalizer, coproduct and free automata (11.2–11.7); characterization of iso-, mono- and epimorphisms (11.8); factorization of automata morphisms (11.9).- 12. Appendix: Basic Notions of Category Theory.- categories (12.1); diagrams (12.2); iso-, mono-, epimorphisms (12.3); products, coproducts (12.4); functors (12.5); natural transformations (12.6); adjoint functors (12.7); comma categories (12.8); special limits and colimits (12.9–12.10).- Special Symbols.- References.

Mer från samma författare

Universal Theory of Automata

W. Kuhnel, H.-J. Kreowski, K.-D. Kiermeier, H. Ehrig

E-bok

2013

452 kr

Graph-Grammars and Their Application to Computer Science and Biology

V. Claus, H. Ehrig, G. Rozenberg

Häftad, 1979

572 kr

HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION - VOLUME 2: APPLICATIONS, LANGUAGES AND TOOLS

EHRIG H, H Ehrig, G Engels, H-J Kreowski, G Rozenberg

Inbunden, 1999

3 076 kr

HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION - VOLUME 3: CONCURRENCY, PARALLELISM, AND DISTRIBUTION

EHRIG H, H Ehrig, H-J Kreowski, U Montanari, G Rozenberg

Inbunden, 1999

2 587 kr

Mer från samma serie

Programmierpraktikum für Ingenieure

Wilhelm M. Pieper

Häftad, 1985

519 kr

Linguistische Datenverarbeitung mit Comskee

Jan Messerschmidt

Häftad, 1984

468 kr

Rekursive Funktionen und ihre Komplexität

Claus Peter Schnorr

Häftad, 1974

468 kr

Del 35

Mathematischer Einführungskurs für Informatiker

Walter Oberschelp, Detlef Wille

Häftad, 1976

468 kr

Problemorientierte Programmiersprachen

Hans Jürgen Schneider

Häftad, 1981

519 kr

Del 15

Hardware Design

Jörg Keller, Wolfgang J. Paul

Häftad, 1995

519 kr

Del 20

Objektorientierter Fachentwurf

Springer Fachmedien Wiesbaden

Häftad, 1997

519 kr

Du kanske också är intresserad av

10% rabatt på allt

L'amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

The Books at the Wake

James S. Atherton

Häftad, 1974

146 kr

Universal Theory of Automata

W. Kuhnel, H.-J. Kreowski, K.-D. Kiermeier, H. Ehrig

E-bok

2013

452 kr

Gesammelte Schriften, 1. Hälfte, KANTS SCHRIFTEN BD 27 1 GEB4.ABT 4.BD 1.HAELFTE

Immanuel Kant

Inbunden, 1974

3 060 kr

Le bon combat. De Courbet aux impressionnistes

Emile Zola

E-bok

1974

454 kr

HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION - VOLUME 2: APPLICATIONS, LANGUAGES AND TOOLS

EHRIG H, H Ehrig, G Engels, H-J Kreowski, G Rozenberg

Inbunden, 1999

3 076 kr

Emblems of the Altdorf Academy

Frederick John Stopp

Inbunden, 1974

329 kr

HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION - VOLUME 3: CONCURRENCY, PARALLELISM, AND DISTRIBUTION

EHRIG H, H Ehrig, H-J Kreowski, U Montanari, G Rozenberg

Inbunden, 1999

2 587 kr

Nebraska Pioneer Cookbook

Kay Graber

Häftad, 1974

169 kr

Del 4

Coins and the Archaeologist

John Casey, Richard Reece

Häftad, 1974

1 066 kr

Universal Theory of Automata

A Categorical Approach

AvH. Ehrig,K.-D. Kiermeier

Häftad, Tyska, 1974

Del i serien XTeubner Studienbücher Informatik

468 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1974-10-01
Mått:148 x 210 x 14 mm
Vikt:321 g
Format:Häftad
Språk:Tyska
Serie:XTeubner Studienbücher Informatik
Antal sidor:240
Upplaga:1974
Förlag:Springer Fachmedien Wiesbaden
ISBN:9783519020547

Utforska kategorier

Innehållsförteckning

1. Unified Representation of Automata.- deterministic, nondeterministic, stochastic, linear, bilinear, and topological automata (1.1–1.7); monoidal categories (1.8–1.10); automata in monoidal categories (1.11–1.14).- 2. Some Problems in Automata Theory.- behavior, reduction, minimization and realization of deterministic automata (2.1–2.6); nondeterministic automata (2.7); transition monoids (2.8); structure theory (2.9).- 3. General Concepts of Reduction, Minimization and Realization.- concept of systematics (3.1); reduced, minimal and realizing systems and subsystematics (3.2–3.3); reduction theorem (3.4); minimal realization theorem (3.6).- 4. Behavior of Automata in Closed Categories: The Deterministic Case.- extended output morphisms and coproducts (4.2); machine morphisms and closed categories (4.3–4.4); characterization of automata (4.5); behavior and image-factorization (4.6–4.7); behavior characterization (4.8); list of examples (4.9).- 5. Reduction and Minimization of Automata in Closed Categories.- systematic of automata in closed categories (5.2); minimal realization theorem (5.3); observable and reduced automata (5.4); reduction and minimization theorem (5.5); monoid automata and transition monoids (5.6–5.7).- 6. Behavior of Automata in Pseudoclosed Categories: The Nondeterministic Case.- automata in pseudoclosed categories — extended output, machine morphism and behavior (6.2–6.4); characterization of machine morphisms and behaviors (6.6–6.7); list of examples (6.8).- 7. Reduction and Minimization of Automata in Pseudoclosed Categories.- construction of reduced and observable automata (7.2–7.4); realization (7.5); systematic of automata in pseudoclosed categories (7.6); reduction theorem (7.7); minimization theorem (7.8); strongminimality (7.9).- 8. Power Automata.- construction of power automata (8.2); power automata theorem (8.3–8.4); kernel automata (8.5).- 9. Initial Automata.- systematic of initial automata (9.2); free realization (9.3); minimal realization theorem (9.5); reachability theorem (9.7); reduction and observability construction (9.8–9.9); observable and finite realization (9.10); initial power automata (9.11).- 10. Scoop Minimization.- scoops and scoop automata theorem (10.2–10.4); scoop construction (10.5–10.7); scoop minimization theorem (10.8).- 11. Structure Theory of Automata.- construction of equalizer, product, coequalizer, coproduct and free automata (11.2–11.7); characterization of iso-, mono- and epimorphisms (11.8); factorization of automata morphisms (11.9).- 12. Appendix: Basic Notions of Category Theory.- categories (12.1); diagrams (12.2); iso-, mono-, epimorphisms (12.3); products, coproducts (12.4); functors (12.5); natural transformations (12.6); adjoint functors (12.7); comma categories (12.8); special limits and colimits (12.9–12.10).- Special Symbols.- References.