April 2015
Intermediate to advanced
482 pages
11h 42m
English
In this chapter, we introduce the definition of Finite Automaton (FA) and also some real-time problems that can be solved using FA. Representation of FA is done using 5-tuple form, transition table and transition diagram. Definitions of non-deterministic and deterministic FAs are explained with examples and, further, how these automata act as language acceptor is elaborated. Equivalence of NFAs-with-ɛ to NFAs-without-ɛ, and equivalence of NFAs to DFAs are explained. Minimizing the given automaton using Myhill Nerode and π construction method, and testing the equivalence of two FAs are discussed. Moore and Mealy machines, which represent Finite Automaton with output, are explained with examples.
The ...
Read now
Unlock full access