Question # 01
Build an FA that accepts onl y those words that do not end with ba.
Question # 02
Build an FA that accepts only those words that begin or end with a double letter.
Question # 03
Build a TG that accepts the language L 1 of all words that begin and end with the
same double letter, either of the form aa . . . aa or bb . . . bb. Note : aaa and bbb are not words in this language.
Share
Answer:
1. Fabulous
please make me brainliest