46. Consider regular expression (0 + 1) (0 + 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains
n + 1 states
n + 2 states
none of these
You must be logged in to post a comment.
47. If regular set A is represented by A = (01 + 1)* and the regular set 'B' is represented by B = ((01)*1*)*, then
A ⊂ B
B ⊂ A
A and B are uncomparable
A = B
48. Which of the following can be recognized by a Deterministic Finite-state Automaton?
Numbers, 1,2,4, ....... zN ..... written in binary.
Numbers 1, 2, 4, ........, zN ...... written in unbinary.
Set of binary string in which number of zeros is same as the number of ones.
Set (1,101,11011,1110111, ......}
49. Which of the following are not regular?
String of 0’s whose length is a perfect square
Set of all palindromes made up of 0’s and 1's
Strings of 0’s, whose length is a prime number
All of these
50. An FSM with
1 stack is more powerful than an FSM with no stack
2 stacks is more powerful than a FSM with 1 stack
both (A) and (B)
UGC NET PAPER 1
UGC NET Management
UGC NET COMPUTER SCIENCE
UGC NET COMMERCE
GATE COMPUTER SCIENCE
CFA Level 1
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login