The goal of this chapter is to provide a unified notational framework for the book, and to introduce key elements of a theory for functional synthesis of FSMs. First we define some useful classes of finite state machines (FSMs) and finite automata (FAs), and investigate their inter-relationship. We will show that a non-deterministic FSM (NDFSM) can be used to specify a set of behaviors. Then we will describe how different behaviors can be explored within an NDFSM specification. These concepts are central to exact algorithms for state minimization for FSMs. At the end of the chapter, the correctness of our state minimization algorithms will be proved for a class of FSMs called pseudo non-deterministic FSMs.
KeywordsInput Sequence State Minimization Exact Algorithm Finite State Machine Finite Automaton
Unable to display preview. Download preview PDF.