0

2.3kviews

Design a DFA to accept strings over the alphabet $\sum={a,b}$ containing even number of a s

written 7.0 years ago by teamques10 ★ 68k

•   modified 2.9 years ago

automata theory

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

194views

written 7.0 years ago by teamques10 ★ 68k

The transition from C to B remains to ensure a loop in the DFA to ensuer even number of a‟s in between occuring b‟s.

Strings tested:

babaaa => (A-A-B-B-C-B-C)

aaaab => (A-B-C-B-C-C-C)

baa => (A-A-B-C)

ADD COMMENT SHARE EDIT