Construct a regular expression and correspondingly an FA for all words in which a appears tripled, if at all. usman October 7, 2015 Theory of Automata FA15 1 Comment (aaa+b)* Post navigation Previous Previous post: Automata Practice QuestionsNext 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