Cos2601 Assignment3 Answers/ Solutions 2026
Assignment questions Sample QUESTION 5 (1) (2) (7) [10] Build an FA (finite automaton) that accepts the language L consisting of all words that: • have a length divisible by 3 without a remainder and • end in the bb-substring L is defined over the alphabet ∑ = {a b}. QUESTION 6 Build an FA (finite automaton) that accepts the language L consisting of all words that: • begin with the aa or bb substring, • end with an a substring, and • have an odd number of letters. L is defined over the alphabet ∑ = {a b}.
Document information
- Uploaded on
- July 22, 2026
- Number of pages
- 29
- Written in
- 2025/2026
- Type
- Other
- Person
- Unknown