
BIBLIOGRAPHIC NOTES
BIBLIOGRAPHIC NOTES
FSMs have long been in use as models of
physical systems, software systems, and
hybrid systems. Almost any book on the
theory of finite automata can be used to
learn more about FSMs, regular
expressions, and regular languages. A
classic book in this area is by Hopcroft and
Ullman [223]. Gill offers an excellent
introduction to the theory of FSMs [168].
The algorithm for the construction of the
characterization set W is found in Chapter
4, Section 4.4 of Gill’s book. Several other
algorithms related to the processing and
testing of FSMs are also found in this
book. Another useful text on the theory of
FSMs is due to Hennie ...