Language of Strings of length two or more, defined over Σ = {a, b}, beginning with and ending in different letters. usman October 7, 2015 Theory of Automata FA15 1 Comment The language L may be expressed by the following regular expression a (a + b)* a + b (a + b)* b Post navigation Previous Previous post: The language of strings, defined over Σ={a, b}, not beginning with aNext Next post: Construct a regular expression and correspondingly an FA for all strings that end in a double letter. 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