Consider a language defined over ∑={a,b} that accepts the strings starting with b.
a. Give its transition diagram using JFlap.
b. Write a C/C++ program that stays in an infinite loop, prompts the user for a string,
terminates if the string is QUIT, and otherwise implements the DFA using the schemet hat allows state to state function-call and recursion.
c. Give the source code and the runtime screen while testing the strings aabab, bbbaba,
bba and abbb.
Comments
Leave a comment