By Topic

Periodic Representations and T-Partitionable Equivalents 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)

This paper deals with the problem of finding nontrivial periodic representations, with not necessarily null transient duration, of deterministic sequential machines. The well-known results in this area, based on means of d-equivalence partitions or regular d-partitions on the set of internal states of a sequential machine A, are generalized. Apart from this, the problem of finding nontrivial periodic representations of A is solved here by the well-known methods of input-independent partitions on the set of internal states of A and by the operation of the (τ, T) numeration introduced here.

Published in:

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