Applications of DFA Online Exam Quiz
Applications of DFA GK Quiz. Question and Answers related to Applications of DFA. MCQ (Multiple Choice Questions with answers about Applications of DFA
It is less complex to prove the closure properties over regular languages using:
Options
A : NFA
B : DFA
C : PDA
D : Can't be said
John is asked to make an automaton which accepts a given string for all the occurrence of '1001' in it. How many number of transitions would John use such that, the string processing application works?
Options
A : 9
B : 11
C : 12
D : 15
Let N (Q, ?, ?, q0, A) be the NFA recognizing a language L. Then for a DFA (Q', ?, ?', q0', A'), which among the following is true?
Options
A : Q' = P(Q)
B : ?' = ?' (R, a) = {q ? Q | q ? ? (r, a), for some r ? R}
C : Q'={q0}
D : All of the mentioned
Statement 1: NFA computes the string along parallel paths.^ Statement 2: An input can be accepted at more than one place in an NFA.^ Which among the following options are most appropriate?
Options
A : Statement 1 is true while 2 is not
B : Statement 1 is false while is not
C : Statement 1 and 2, both are true
D : Statement 1 and 2, both are false
There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the maximum number of states in its equivalent DFA?
Options
A : 226
B : 224
C : 225
D : 223
Under which of the following operation, NFA is not closed?
Options
A : Negation
B : Kleene
C : Concatenation
D : None of the mentioned
Which of the following do we use to form an NFA from a regular expression?
Options
A : Subset Construction Method
B : Power Set Construction Method
C : Thompson Construction Method
D : Scott Construction Method
Which of the following is an application of Finite Automaton?
Options
A : Compiler Design
B : Grammar Parsers
C : Text Search
D : All of the mentioned
Which of the following options is correct for the given statement?^ Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2k.
Options
A : TRUE
B : FALSE
C : -
D : -
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols