1. Build a FA that accepts the language of strings, over alphabet {a, b}, that start with a followed by b or with b followed by a and that end with a. Problem 4: 2. Build a TG that accepts the language of strings, over alphabet {a, b}, that start with ab and end with ba or those that start with ba and end with ab.
Thank you in advace for quick response for both questions. Thanks
1. Build a FA that accepts the language of strings, over alphabet {a, b}, that start with a followed by b or with b followed by a and that end with a.
Problem 4:
2. Build a TG that accepts the language of strings, over alphabet {a, b}, that start with ab and end with ba or those that start with ba and end with ab.
Given the first question 1 , we have to draw FA that accept alphabet {a,b} that start with a followed by b or with b followed by a and that end with a.
Given the first question 2, we have to draw TG that accept the language of strings, over alphabet {a, b}, that start with ab and end with ba or those that start with ba and end with ab.
Step by step
Solved in 3 steps with 2 images
