Computer Science and Application: Obtain an NFA to accept the following language L = {w | w ∈ abab(power)n or aba(power)n where n >=0}

Thursday, April 5, 2012

Obtain an NFA to accept the following language L = {w | w ∈ abab(power)n or aba(power)n where n >=0}

The machine to accept either ababⁿ or abaⁿ where n  0 is shown below:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)