DFA – Deterministic Finite Automata

1. Define a DFA with the alphabet { a, b, c, d, e}. Accept all strings that contain only vowels (a and e). Reject all oth

1. Define a DFA with the alphabet { a, b, c, d, e}. Accept all strings that contain only vowels (‘a’ and ‘e’). Reject all other inputs 2. Write a Flex regular expression with the same alphabet that defines strings of letters containing only ‘a’ and ‘e’ , in any combination, any order, and any number. 3. Define a DFA that will process input strings of letters from a to e Accept all strings of exactly 3-letters with a vowel in the middle. (Examples: dad, baa, aec, eee) Reject the null string and all inputs that do not have a vowel in the middle. (Examples: add, ell, fly) 4. Write a Flex regular expression that defines exactly the same language



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *