By Topic

A Technique for the Reduction of a Given Machine to a Minimal-State Machine

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)
Ginsburg, Seymour ; Hughes Research Labs., P.O. Box 90427, Los Angeles, Calif.

A technique is presented for reducing an arbitrary machine S as much as possible to a machine T which can do everything (from the input-output point of view) that S can do. Since the technique is always applicable, it is more powerful (although more cumbersome) than the well-known merging technique. Several examples are given.

Published in:

Electronic Computers, IRE Transactions on  (Volume:EC-8 ,  Issue: 3 )