Compilers Obtaining Regular Expression From Finite Automata 1 Online Exam Quiz
Compilers Obtaining Regular Expression From Finite Automata 1 GK Quiz. Question and Answers related to Compilers Obtaining Regular Expression From Finite Automata 1. MCQ (Multiple Choice Questions with answers about Compilers Obtaining Regular Expression From Finite Automata 1
The number of states in DFA that accepts the language L(M) ? L(N) is _________
Options
A : 0
B : 1
C : 2
D : 3
How many minimum states are required to find whether a string has odd number of 0’s or not?
Options
A : 1
B : 2
C : 3
D : 4
Which of the following pairs of regular expression are equivalent?
Options
A : 1(01)* and (10)*1
B : X(xx)* and (xx)*x
C : 1(01)* and (10)*1 & X(xx)* and (xx)*x
D : None of the mentioned
What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
Options
A : L must be {an| n is odd}
B : L must be {an| n is even}
C : L must be {an| n is even}
D : Either L must be {an | n is odd}, or L must be {an | n is even}
L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true?
Options
A : L1 = {0, 1}* – L
B : L1 = {0, 1}* – L
C : L1 ? L
D : L1=L
The reorganizing capability of NDFA and DFA is?
Options
A : May be different
B : Must be different
C : Must be same
D : None of the mentioned
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?
Options
A : N2
B : 2N
C : 2N
D : N!
Which of the following is not regular?
Options
A : String whose length is perfect square and consists of 0s
B : Palindromes consisting of 0’s and 1’s
C : String whose length is perfect square and consists of 0s & Palindromes consisting of 0’s and 1’s
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Nfa Epsilon Moves Dfa 1
Compilers Non Deterministic Finite Automata 1