Subscribe to:
Post Comments
(
Atom
)
Consider the grammar G: ({S, A}, {a, b}, {P, S}) where p consists of: S → aAs | a A → sbA | ss | ba Draw a parse tree for the string aabbaa and left most derivations.
Prove that, every language defined by regular expression is also defined by a finite automata.
No comments
Dear Members, Thanks for Your Comments. We must be reply your comment answer as soon as possible. Please Stay with us.....