The language of strings, defined over Σ={a, b}, beginning with b usman October 7, 2015 Theory of Automata FA15 1 Comment Post navigation Previous Previous post: Construct a regular expression and correspondingly an FA for all strings that end in a double letter.Next Next post: The language of strings, defined over Σ={a, b}, not beginning with a 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