Regular Language to DFA conversion -
i ran problem in textbook can't decipher , hoping help. i'm not asking solution, translation, or push in right direction. in jflap textbook.
the alphabet consists of "a".
{a^l |l = 0 (mod 6), l /= 0 (mod 4) }
construct dfa recognizes language.
i assume if string of a's multiple of 6 string accepted, don't understand l/= 0 mean. there multiple questions this.
again, don't need, or want, answer problem, maybe translation english sentence me understand asking for.
l /= 0 (mod 4)
means l not congruent 0 mod 4 (the opposite of l = 0 (mod 4)
)
when write hand, put slash through symbol (like ≠)
Comments
Post a Comment