|
|
|
|
| LEADER |
00000cam a2200000Mi 4500 |
| 001 |
on1089593318 |
| 003 |
OCoLC |
| 005 |
20240623213015.0 |
| 006 |
m o d |
| 007 |
cr |n|---||||| |
| 008 |
190309s2019 nju o 000 0 eng d |
| 010 |
|
|
|a 2018034871
|
| 040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCQ
|d REDDC
|d OCLCO
|d UX1
|d OCLCF
|d K6U
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|d SXB
|
| 019 |
|
|
|a 1175630601
|
| 020 |
|
|
|a 9781119517511
|
| 020 |
|
|
|a 1119517516
|
| 020 |
|
|
|a 9781119517474
|q (hardcover)
|
| 020 |
|
|
|a 1119517478
|
| 020 |
|
|
|z 9781119517498
|q (ePDF)
|
| 035 |
|
|
|a (OCoLC)1089593318
|z (OCoLC)1175630601
|
| 050 |
|
4 |
|a QA10.3
|b .V533 2019
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Vlad, Serban E.
|
| 245 |
1 |
0 |
|a Boolean Functions :
|b Topics in Asynchronicity.
|
| 260 |
|
|
|a Newark :
|b John Wiley & Sons, Incorporated,
|c 2019.
|
| 300 |
|
|
|a 1 online resource (309 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a 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
|
| 505 |
8 |
|
|a 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
|
| 505 |
8 |
|
|a 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
|
| 505 |
8 |
|
|a 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
|
| 505 |
8 |
|
|a 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
|
| 500 |
|
|
|a 12 The Strong Generalized Technical Condition of Proper Operation
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 650 |
|
0 |
|a Algebra, Boolean.
|
| 650 |
|
7 |
|a Algebra, Boolean
|2 fast
|
| 758 |
|
|
|i has work:
|a Boolean functions (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGhBHJcx6xXfvJ4f9yCBWC
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Vlad, Serban E.
|t Boolean Functions : Topics in Asynchronicity.
|d Newark : John Wiley & Sons, Incorporated, ©2019
|z 9781119517474
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=5721164
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 994 |
|
|
|a 92
|b HCD
|