Unit 2 - Regular Languages And Finite Automata
11 Questions
Settings
-
+
TEST 1
Questions and Answers
- 1.Regular expression for all strings starts with ab and ends with bba is.
- A.
Aba*b*bba
- B.
Ab(ab)*bba
- C.
Ab(a+b)*bba
- D.
All of the mentioned
- 2.A language is regular if and only if
- A.
Accepted by DFA
- B.
Accepted by PDA
- C.
Accepted by LBA
- D.
Accepted by Turing machine
- 3.Number of states require to accept string ends with 10.
- A.
3
- B.
2
- C.
1
- D.
Can’t be represented.
- 4.Regular expressions are closed under
- A.
Union
- B.
Intersection
- C.
Kleen star
- D.
All of the mentioned
- 5.Regular expressions that do not contain the star operator can represent only finite languages.
- A.
True
- B.
False
- 6.Language of finite automata is.
- A.
Type 0
- B.
Type 1
- C.
Type 2
- D.
Type 3
- 7.Which of the following are not regular ?
- A.
String of 0's whose length is a perfect square
- B.
Set of all palindromes made up of 0's and 1's
- C.
Strings of 0's, whose length is a prime number
- D.
All of these
- 8.Finite automata requires minimum _______ number of stacks.
- A.
1
- B.
0
- C.
2
- D.
3
- 9.The basic limitation of finite automata is that
- A.
It can’t remember arbitrary large amount of information.
- B.
It sometimes recognize grammar that are not regular.
- C.
It sometimes fails to recognize regular grammar
- D.
All of the mentioned
- 10.Transition function maps.
- A.
Σ * Q -> Σ
- B.
Q * Q -> Σ
- C.
Σ * Σ -> Q
- D.
Q * Σ -> Q
- 11.Which one do you like?
- A.
Option 1
- B.
Option 2
- C.
Option 3
- D.
Option 4
Back to top