Cart (Loading....) | Create Account
Close category search window
 

On the Decomposition of Periodic Representations of 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

1 Author(s)

In this note a sequential machine decomposition implied by the fact that this machine possesses a nontrivial periodic representation is discussed. If it is fulfilled, then for the state behavior of such a sequential machine there exists a nontrivial serial decomposition into two machines, where one of them is autonomous. Moreover, if for a sequential machine there exists a reducible periodic representation, then for the state behavior of this sequential machine there exists a nontrivial parallel decomposition into two machines such that one of them is autonomous. These results permit us to discuss the state-splitting problem with the aid of the T-partitionable equivalency.

Published in:

Computers, IEEE Transactions on  (Volume:C-20 ,  Issue: 8 )

Date of Publication:

Aug. 1971

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.