Authors: Stanković, Radomir 
Astola, Jaakko
Moraga, Claudio
Stanković, Stanislav
Title: Remarks on systems, beads, and bead sets
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 8112 LNCS
Issue: PART 2
First page: 258
Last page: 265
Conference: 14th International Conference on Computer Aided Systems Theory, EUROCAST 2013; Las Palmas de Gran Canaria; Spain; 10 February 2013 through 15 February 2013
Issue Date: 1-Dec-2013
Rank: M33
ISBN: 978-3-642-53861-2
ISSN: 0302-9743
DOI: 10.1007/978-3-642-53862-9_33
Beads are a particular class of binary sequences with interesting properties due to which they can be related to Binary decision diagrams. Recently, the concept of beads was extended to integer sequences and sequences over finite fields and used in the classification of logic functions in terms of decision diagrams. In this paper, sets of beads and integer beads are used to estimate the equality of structure of digital systems implementing logic functions.
Keywords: Beads | Decision diagrams | Logic functions | Systems
Publisher: Springer Link

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.