By Topic

The Simplification of Sequential Machines with Input Restrictions

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)
Joonki Kim ; Department of Electrical Engineering and Computer Science, Columbia University ; Newborn, Monroe M.

A procedure is presented for simplifying the flow table of a sequential machine M when, in addition to the given flow table, it is specified that certain input sequences cannot occur. It is assumed that M receives its input from the output of another machine M, and that the restricted sequences are therefore those sequences that M, cannot generate.

Published in:

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