000			03993nam a22004335i 4500
999			_c387803 _d387803
001			387803
003			ES-MaUEC
005			20230328162401.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2015 sz | s |||| 0|eng d
020			_a9783031798702
024	7		_a10.1007/978-3-031-79870-2 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aT57.95 _b2015 EB
100	1		_aButler, Jon T. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687823
245	1	0	_aApplications of Zero-Suppressed Decision Diagrams _cby Jon T. Butler, Tsutomu Sasao
250			_a1st edition 2015
264		1	_aCham _bSpringer International Publishing _c2015
300			_a1 recurso en línea (XVIII, 106 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Digital Circuits & Systems _x1932-3174
505	0		_aPreface -- Acknowledgments -- Introduction to Zero-Suppressed Decision Diagrams -- Efficient Generation of Prime Implicants and Irredundant Sum-of-Products Expressions -- The Power of Enumeration--BDD/ZDD-Based Algorithms for Tackling Combinatorial Explosion -- Regular Expression Matching Using Zero-Suppressed Decision Diagrams -- Authors' and Editors' Biographies -- Index .
520			_aA zero-suppressed decision diagram (ZDD) is a data structure to represent objects that typically contain many zeros. Applications include combinatorial problems, such as graphs, circuits, faults, and data mining. This book consists of four chapters on the applications of ZDDs. The first chapter by Alan Mishchenko introduces the ZDD. It compares ZDDs to BDDs, showing why a more compact representation is usually achieved in a ZDD. The focus is on sets of subsets and on sum-of-products (SOP) expressions. Methods to generate all the prime implicants (PIs), and to generate irredundant SOPs are shown. A list of papers on the applications of ZDDs is also presented. In the appendix, ZDD procedures in the CUDD package are described. The second chapter by Tsutomu Sasao shows methods to generate PIs and irredundant SOPs using a divide and conquer method. This chapter helps the reader to understand the methods presented in the first chapter. The third chapter by Shin-Ichi Minato introduces the ""frontier-based"" method that efficiently enumerates certain subsets of a graph. The final chapter by Shinobu Nagayama shows a method to match strings of characters. This is important in routers, for example, where one must match the address information of an internet packet to the proprer output port. It shows that ZDDs are more compact than BDDs in solving this important problem. Each chapter contains exercises, and the appendix contains their solutions. Table of Contents: Preface / Acknowledgments / Introduction to Zero-Suppressed Decision Diagrams / Efficient Generation of Prime Implicants and Irredundant Sum-of-Products Expressions / The Power of Enumeration--BDD/ZDD-Based Algorithms for Tackling Combinatorial Explosion / Regular Expression Matching Using Zero-Suppressed Decision Diagrams / Authors' and Editors' Biographies / Index.
988			_aSynthesis Collection of Technology_2015
650		7	_2embne _9139136 _aLógica matemática
650		7	_2embne _9687232 _aMétodos gráficos
650		7	_2embne _9139135 _aCircuitos lógicos _xDiseño
700	1		_aSasao, Tsutomu, _d1950- _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686476
776	0	8	_iPrinted edition: _z9783031798696
776	0	8	_iPrinted edition: _z9783031798719
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79870-2 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI