By Topic

Modular Networks and Nondeterministic Sequential Machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Drilman, J. ; Department of Electrical Engineering, Princeton University ; Weiner, Peter

The synthesis of sequential machines by interconnections of copies of a fixed module is considered. A family of modules Mr,pfor positive integers r and p, is defined. Mr,p can be used to synthesize sequential machines with 2Pinput symbols. A nondeterministic sequential machine (NSM) is said to be r-bounded if it has one initial state and for no state and input are there more than r choices for the next state. It is shown that the problem of finding a network of modules Mr,prealizing a given event E is equivalent to finding an r-bounded NSM realizing the reverse of E. As a consequence, two upper bounds on the number of copies of the module Mr,pnecessary to realize an event E can be shown. 1) If E is defined by an n-state NSM, then E is defined by a network of at most cln2+plogr2copies of Mr,p. 2) If E is defined by an n-state deterministic sequential machine, then E is defined by a network of at most c2nl+vlogr2copies of Mr,p. cland C2are constants, about 4.

Published in:

Computers, IEEE Transactions on  (Volume:C-21 ,  Issue: 10 )