9

Minimisation of Sequential Machines

LEARNING OBJECTIVES

After studying this chapter, you will know about:

  1. Limitations of finite state machines.
  2. Mealy and Moore Models.
  3. State minimisation of completely specified machines using Partition technique, and Merger chart.
  4. State reduction in incompletely specified sequential machines.
  5. Bounds on minimal state machines.
9.1 LIMITATIONS OF FINITE STATE MACHINES

There are some problems which can not be solved by any finite state machine (FSM). The objective of this section is to present some simple problems of this category.

We have discussed in a previous chapter how serial binary addition of two words of any length can be performed by a sequential machine with two states only. Such a sequential ...

Get Switching Theory and Logic Design now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial