Subject talk:Automata theory

Let L be the language over the alphabet(a1,a2,a3)defined as:

L:All strings in which ai occurs at least i times from some ai in (a1,a2,a3).

draw a non -deterministic finite automaton (NFA)for L