|
|
|
|
| LEADER |
03965nmm a2200277 u 4500 |
| 001 |
EB000668239 |
| 003 |
EBX01000000000000000521321 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783642616112
|
| 100 |
1 |
|
|a Gecseg, Ferenc
|
| 245 |
0 |
0 |
|a Products of Automata
|h Elektronische Ressource
|c by Ferenc Gecseg
|
| 250 |
|
|
|a 1st ed. 1986
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1986, 1986
|
| 300 |
|
|
|a VIII, 108 p
|b online resource
|
| 505 |
0 |
|
|a 1. Basic Concepts and Preliminaries -- 1.1 Sets and Relations -- 1.2 Algebraic Structures -- 1.3 Automata and Sequential Machines -- 1.4 Products and Complete Systems of Sequential Machines and Automata -- 2. Homomorphic Representations -- 2.1 A Homomorphically Complete System for the ?0-Product -- 2.2 A Minimal Homomorphically Complete System with Respect to the ?0-Product -- 2.3 Homomorphic Representations of Automata by ?0- and ?1-Products of Smaller Automata -- 2.4 Homomorphically Complete Systems for ?i-Products withu i> 1 -- 2.5 Comparison of the Homomorphic Representation Powers of ?i-Products -- 2.6 Homomorphically ?i-Simple Automata -- 2.7 A Decidability Result -- 3. Isomorphic Representations -- 3.1 Embedding into ?i-Products of Automata with Fewer States Than a Given Integer -- 3.2 Isomorphically Complete Systems for the ?0-Product -- 3.3 Isomorphically Complete Systems for ?i-Products with i? 1 -- 3.4 Comparison of the Isomorphic Representation Powers of ?i-Products -- 3.5 Isomorphically Complete Classes for Nilpotent Automata -- 4. Generalized Products and Simulations -- 4.1 Basic Concepts -- 4.2 Simulations by Generalized ?0-Products -- 4.3 Simulations by Generalized ?1-Products -- 4.4 Simulations by Generalized Products and Generalized ?i-Products with i> 1 -- 4.5 Homomorphic Representations by a Restricted Form of Generalized Products -- 5. Representation of Automaton Mappings in Finite Length. Infinite Products -- 5.1 Metric Completeness -- 5.2 Equational Classes of Automata -- 5.3 Metric Equivalence of Products -- Bibliographical Remarks -- References
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Theory of Computation
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-61611-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-61611-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a Both theoretical and practical considerations motivate the repre sentation of objects as certain compositions of simpler ones. In the theory of automata this observation has led to the concepts of pro ducts and complete systems of automata. In the general form of the products of automata all the component automata are fed back to one another. With this very broad notion of products, the realization of automata with large numbers of states by means of compositions of basic components is a highly involved process; this increases the possibility of errors. In order to decrease the complexity of feedbacks, a hierarchy of products called lXi-pro ducts was introduced some 10 years ago, where i runs over the set of all non-negative integers. In an IXcproduct the index set of the component automata is linearly ordered. The input of each automaton in the product may depend on the states of all automata preceding it, i. e. , all component automata steer all those automata which follow them in the product. Furthermore, at most the next i-I automata (including itself) may be fed back to the input of a given component automaton. Thus for iXcproducts the lengths of feedbacks are at most i. The aim of this monograph is to give a systematic account of iXi-Products. It consists of five chapters, a reference section, and an index. The first chapter contains the necessary concepts and results from universal algebra, automata, and sequential machines
|