Thread: Regular Expression (Theory of Automata)

Dear I m New to this Subject
Theory of Automata,
I have attached the file wher i need help

Plz Help me to solve the Problems

I ll be thankfull to u All Guruz.

Not many people will review questions posted in external files. If you sincerely want help, then learn LaTeX (http://www.mathhelpforum.com/math-he...-tutorial.html and http://www.mathhelpforum.com/math-he...-tutorial.html) and/or post scanned diagrams.

Dear
i ll try to upload that

Thanx

These are the questions and the figure are attached .



Question No.1
Find the Regular Expression corresponding to the given FA. Show all steps.
[Hint: FA to GTG a GTG to RE.]



Question No.2
A student walks into a classroom and sees on the blackboard a diagram of a TG with two states that accepts only the string Λ. The student reverses the direction of exactly one edge, leaving all other edges and all labels and all final states (+’s) and start state (-) the same. The new TG accepts the language a*. What was the original TG?



Question No. 3

Determine RE corresponding to the following TG. Show all steps. [Hint: TG to GTG a GTG to RE.]