Seminar on quantum automata and Languages
Problem of the DAY Create a regular context-free grammar that generates L= {w {a,b}* : the number of a’s in w is not divisible by 3} Hint: start by designing.
Announcements: Assignment 3 has been posted.
For each language, give a DFA that accepts it. L 1 = { w {a, b}* : w at most 2 a’s}
