Finding redundant constraints in FSM minimization

Yuan Lin, Pushkin R. Pari, Gang Qu · 2004

Finite state machine (FSM) is a computation model that consists of a finite set of states, a start state, an input alphabet, and a transition function that defines the next state and/or outputs based on the current state and input symbols.

Read the paper · More papers on PaperTik