Describe applications of finite automata.
We
mention some application of finite automata, here:
(i) Lexical
analyzers: It is a tool in which it to need the input characters from
left-to-right and produce as output a sequence of tokens that the parser uses
for syntax analysis.
(ii)
Text editor:
Text editor permit the substitution of a string for any string matching a given
regular expression.
S/bbb*/b/
That
substitutes a single blank for the first string of two or more blanks found in
a given line.
(iii) Text search:
Non-deterministic finite Automata (NFA) are a useful way to represent a pattern
matcher that scans a large body of text for one or more keywords.
(iv)
Switching circuit:
Finite Automata is also used in the switching circuit.
(v)
To implement compiler design: Finite automata is also used to implement
the compiler design.
No comments
Dear Members, Thanks for Your Comments. We must be reply your comment answer as soon as possible. Please Stay with us.....