Construct a regular expression and correspondingly an FA for all strings that end in a double letter. usman October 7, 2015 Theory of Automata FA15 1 Comment The regular expression is as follows:- (a+b)*(aa+bb) Post navigation Previous Previous post: Language of Strings of length two or more, defined over Σ = {a, b}, beginning with and ending in different letters.Next Next post: Give a NFA that only accepts binary numbers including the substring “101”. 1 Comment Pingback: Automata Practice Questions | Usman's Blog Leave a Reply Cancel reply Your email address will not be published. Required fields are marked *Comment Name * Email * Website
Pingback: Automata Practice Questions | Usman's Blog