Test: Applications of NFA - Computer Science Engineering (CSE) MCQ

 NFA is said to be closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Kleene
e) Negation.

None.

There are many applications of finite automata, mainly in the field of Compiler Design and Parsers and Search Engines.

None.

Thompson Construction method is used to turn a regular expression in an NFA by fragmenting the given regular expression through the operations performed on the input alphabets.

 Idle is the state when data in form of packets is send and returns if NAK is received else waits for the NAK to be received.

 Finite state automation is used in Lexical Analyser, Computer BOT (used in games), State charts, etc.

L1= {w | w does not contain the string tr }
L2= {w | w does contain the string tr}
Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?

None.

We need to make the number of a as fixed i.e. 2 and b can be 2 or more. Thus, using this condition a finite automata can be created using 1 states.