Cargando…
Boolean Functions : Topics in Asynchronicity.
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Newark :
John Wiley & Sons, Incorporated,
2019.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Intro; Table of Contents; Preface; 1 Boolean Functions; 1.1 The Binary Boole Algebra; 1.2 Definition of the Boolean Functions. Examples. Duality; 1.3 Iterates; 1.4 State Portraits. Stable and Unstable Coordinates; 1.5 Modeling the Asynchronous Circuits; 1.6 Sequences of Sets; 1.7 Predecessors and Successors; 1.8 Source, Isolated Fixed Point, Transient Point, Sink; 1.9 Translations; 2 Affine Spaces Defined by Two Points; 2.1 Definition; 2.2 Properties; 2.3 Functions that Are Compatible with the Affine Structure of; 2.4 The Hamming Distance. Lipschitz Functions; 2.5 Affine Spaces of Successors
- 3 Morphisms3.1 Definition; 3.2 Examples; 3.3 The Composition; 3.4 A Fixed Point Property; 3.5 Symmetrical Functions Relative to Translations. Examples; 3.6 The Dual Functions Revisited; 3.7 Morphisms vs. Predecessors and Successors; 4 Antimorphisms; 4.1 Definition; 4.2 Examples; 4.3 The Composition; 4.4 A Fixed Point Property; 4.5 Antisymmetrical Functions Relative to Translations. Examples; 4.6 Antimorphisms vs Predecessors and Successors; 5 Invariant Sets; 5.1 Definition; 5.2 Examples; 5.3 Properties; 5.4 Homomorphic Functions vs Invariant Sets
- 5.5 Special Case of Homomorphic Functions vs Invariant Sets5.6 Symmetry Relative to Translations vs Invariant Sets; 5.7 Antihomomorphic Functions vs Invariant Sets; 5.8 Special Case of Antihomomorphic Functions vs Invariant Sets; 5.9 Antisymmetry Relative to Translations vs Invariant Sets; 5.10 Relatively Isolated Sets, Isolated Set; 5.11 Isomorphic Functions vs Relatively Isolated Sets; 5.12 Antiisomorphic Functions vs Relatively Isolated Sets; 6 Invariant Subsets; 6.1 Definition; 6.2 Examples; 6.3 Maximal Invariant Subset; 6.4 Minimal Invariant Subset; 6.5 Connected Components
- 6.6 Disconnected Set7 Path Connected Set; 7.1 Definition; 7.2 Examples; 7.3 Properties; 7.4 Path Connected Components; 7.5 Morphisms vs Path Connectedness; 7.6 Antimorphisms vs Path Connectedness; 8 Attractors; 8.1 Preliminaries; 8.2 Definition; 8.3 Properties; 8.4 Morphisms vs Attractors; 8.5 Antimorphisms vs Attractors; 9 The Technical Condition of Proper Operation; 9.1 Definition; 9.2 Examples; 9.3 Iterates; 9.4 The Sets of Predecessors and Successors; 9.5 Source, Isolated Fixed Point, Transient Point, Sink; 9.6 Isomorphisms vs tcpo; 9.7 Antiisomorphisms vs tcpo
- 10 The Strong Technical Condition of Proper Operation10.1 Definition; 10.2 Examples; 10.3 Iterates; 10.4 The Sets of Predecessors and Successors; 10.5 Source, Isolated Fixed Point, Transient Point, Sink; 10.6 Isomorphisms vs Strong tcpo; 10.7 Antiisomorphisms vs Strong tcpo; 11 The Generalized Technical Condition of Proper Operation; 11.1 Definition; 11.2 Examples; 11.3 Iterates; 11.4 The Sets of Predecessors and Successors; 11.5 Source, Isolated Fixed Point, Transient Point, Sink; 11.6 Isomorphisms vs the Generalized tcpo; 11.7 Antiisomorphisms vs the Generalized tcpo; 11.8 Other Properties