11-02-2012, 05:01 PM
Draw a Finite Automaton (FA) that accepts the following strings:
Λ, a, aabc, acba and accb
Construct a finite automaton for the given Regular Expression (RE):
(a + b)*(ab + ba)+a+
Draw a Transition Graph (TG) for the language expressed by the following regular expression:
^ + 0(01 + 10)*1 + 1(10 + 01)*0
Λ, a, aabc, acba and accb
Construct a finite automaton for the given Regular Expression (RE):
(a + b)*(ab + ba)+a+
Draw a Transition Graph (TG) for the language expressed by the following regular expression:
^ + 0(01 + 10)*1 + 1(10 + 01)*0