Q. 1. Draw a Finite Automaton (FA) that accepts the following strings:View more random threads:
- need help in guideline of preparation of fuji foudation...
- cs201 solution idea on 15th April 2011
- need CS304 4th assignment
- How to write the background of research May 2011
- Mcm304
- I want GDB 201 solution imidiately!
- phy101 Assignment 5: (Fall 2010)
- CS 506 assignment #1 help needed!
- CS501 Assignment #3
- MTH101 Assigment#5 solution required
Λ, a, aabc, acba and accb Marks [7]
ANSWER.1.
Q. 2. Construct a finite automaton for the given Regular Expression (RE):
(a + b)*(ab + ba)+a+ Marks [8]
ANSWER.2
.
Q. 3. Draw a Transition Graph (TG) for the language expressed by the following regular expression:
^ + 0(01 + 10)*1 + 1(10 + 01)*0 Marks [5]
Sponsored Links
ANSWER.3.