TEST 1
3
2
1
Can’t be represented.
Type 0
Type 1
Type 2
Type 3
1
0
2
3
Aba*b*bba
Ab(ab)*bba
Ab(a+b)*bba
All of the mentioned
It can’t remember arbitrary large amount of information.
It sometimes recognize grammar that are not regular.
It sometimes fails to recognize regular grammar
All of the mentioned
Σ * Q -> Σ
Q * Q -> Σ
Σ * Σ -> Q
Q * Σ -> Q
True
False
Accepted by DFA
Accepted by PDA
Accepted by LBA
Accepted by Turing machine
Union
Intersection
Kleen star
All of the mentioned
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
Option 1
Option 2
Option 3
Option 4