Scribd
Upload
97 views4 pages

Solutions DFA Problem

The document describes 4 solutions for DFAs (Deterministic Finite Automata): 1) accepting strings ending in 0, 2) with an odd number of 1's, 3) with an even number of 0's or any number of 1's, 4) containing the sequence '11' somewhere in the string.

Uploaded by

rhejlim6354
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
97 views4 pages

Solutions DFA Problem

The document describes 4 solutions for DFAs (Deterministic Finite Automata): 1) accepting strings ending in 0, 2) with an odd number of 1's, 3) with an even number of 0's or any number of 1's, 4) containing the sequence '11' somewhere in the string.

Uploaded by

rhejlim6354
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Solution No.

1
DFA accepting strings that end in 0
Solution No. 2
DFA accepting strings with odd number
of 1s

0 0
1

1 2

1
Solution No. 3
DFA accepting strings containing even
number of 0s or any number of 1s
Solution No. 4
DFA accepting strings that have a
sequence 11 somewhere in the
string

You might also like