L = {w:(na(w) - na (w))) mod 3 not equal 1}?

0 ⤊

Find regual grammar for the above language on {a,b}

This is about formal languages and automata

2006-10-11 10:44:14 · 1 answers · asked by new_comer_ct 1 in Computers & Internet ➔ Software

L = {w:(na(w) - nb (w))) mod 3 not equal 1}?
na = number of a's and nb = number of b's

2006-10-11 10:45:29 · update #1

IS this new phonics? Or a programming language?

2006-10-14 15:17:50 · answer #1 · answered by Teacher Man 6 · 0⤊ 0⤋