Solved Paper-II On Topic : Solved Paper-II June 2007

Que : 1 . The following deterministic finite automata recognizes:

1. Set of all strings containing ‘ab’
2. Set of all strings containing ‘aab’
3. Set of all strings ending in ‘abab’
4. None of the above
Please Select Ans Options .
Explanation

MEMBERSHIP REQUIRED !