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 |
|
Option: D Explanation : Click on Discuss to view users comments. Aman said: (11:18am on Wednesday 26th July 2017)
option A) it is not a regular language bcz it has infinte memory and does not contain an AP series.option B) 0^n1^n 0^nis also an palindrome but it is not regular because it need 2 unit memory for acceptance.option C) again it does not mantain AP series so it is not regular.option D is right
|
The main difference between a DFSA and an NDFSA is
| A. | in DFSA, ε transition may be present |
| B. | in NDFSA, ε transitions may be present |
| C. | in DFSA, from any given state, there can't be any alphabet leading to two diferent states |
| D. | in NDFSA, from any given state, there can't be any alphabet leading to two diferent states |
|
Option: C Explanation : Click on Discuss to view users comments. Aman said: (11:25am on Wednesday 26th July 2017)
tranisition function in DFA is (Q*E)=Q and NFA (Q*E)=2^Q
|
If w ∈ (a, b)* satisfy abw = wab, then (w) is
| A. | even |
| B. | odd |
| C. | null |
| D. | none of these |
|
Option: A Explanation : Click on Discuss to view users comments. vikki gound said: (1:29am on Thursday 23rd May 2013)
because W will take only even number of string
|
