Finite state automata is a mathematical (model) abstract machine that has set of “States” and its “control” moves from state to state in response to external “inputs”. The control may be either “deterministic” meaning that the automation cannot be in more than one state at any one time, or “non-deterministic” meaning that the automation can be in more than one state at once. This distinguishes two class of finite state automata. They are:
- The Deterministic Finite Automata
- Non-Deterministic Finite Automata
Applications of Finite State Automata: Basis for
programs line spell checking, grammar checking, indexing, searching large body
of text, recognizing speech, transforming text using markup languages line XML
and HTML and network protocols that specify how computers communicate.
Comments
Post a Comment