Compilers Transformation From Nfa Dfa 1 Online Exam Quiz
Compilers Transformation From Nfa Dfa 1 GK Quiz. Question and Answers related to Compilers Transformation From Nfa Dfa 1. MCQ (Multiple Choice Questions with answers about Compilers Transformation From Nfa Dfa 1
Regular expression a/b denotes which of the following set?
Options
A : {a}
B : {€,a,b}
C : {a,b}
D : {ab}
What is the relation between NFA-accepted languages and DFA accepted languages?
Options
A : >
B : <
C : =
D : <=
Which behaviour of a NFA can be stimulated by DFA?
Options
A : Always
B : Sometimes
C : Never
D : Depends on NFA
In regular expressions, the operator ‘*’ stands for?
Options
A : Concatenation
B : Selection
C : Iteration
D : Addition
Can a DFA simulate NDFA?
Options
A : No
B : Yes
C : Sometimes
D : Depends on NDFA
Find the wrong statement?
Options
A : The language accepted by finite automata are the languages denoted by regular expression
B : Every DFA has a regular expression denoting its language
C : For a regular expression r, there does not exists NDFA with L® ant transit that accept
D : None of the mentioned
For any DFA state {qi,qj…qm} If some qj is a final state in the NFA Then {qi,qj…qm}, is a final state in the DFA.
Options
A : True
B : False
C :
D :
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Three Address Statements 1
Compilers Three Address Statements 2
Compilers Transformation From Nfa Dfa 2
Automobile Engineering 2stroke Engines
Automobile Engineering Aptitude Test