Scribd
Upload
2 views

Assignment 1 Automata

Uploaded by

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

Assignment 1 Automata

Uploaded by

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

Theory of Automata V4 Assignment 1 25 April 2025

Deterministic Finite Automata (DFA)


Deadline: Wednesday, 9 am, 30 April 2025

Assignment Instructions and Submission Guidelines:


• For each question
o Design DFA
o Clearly label your states, transitions, start state, and accepting
states.
o Try to draw the DFA diagram neatly.
o Briefly explain your logic for DFA construction (2-3 lines).
o Highlight any assumptions you make.
o You need to work on a Word document. Please add a picture of
hand-drawn DFA diagrams in the Word document.

Problem Set 1:
1. Construct a DFA over {0,1} that accepts all strings containing at least
one '1'.
2. Construct a DFA over {a, b} that accepts strings that start with 'a'.
3. Construct a DFA over {0,1} that end with '0'.
4. Construct a DFA that accepts the empty string and only the string "0"
over {0,1}.
5. Construct a DFA that accepts strings of exactly length 3 over {a, b}.
6. Construct a DFA that accepts only the string "ab" over {a,b}.
Construct a DFA that accepts strings over {0,1} with no consecutive 1’s.
Theory of Automata V4 Assignment 1 25 April 2025

Problem Set 2:
1. Construct a DFA that accepts strings over {0,1} where the number of 1’s
is even.
2. Construct a DFA that accepts strings over {a,b} where baa appears as a
substring.
3. Construct a DFA over {a,b} where no two a’s appear consecutively.
4. Construct a DFA that accepts strings over {0,1} starting and ending with
the same symbol.
5. Construct a DFA that accepts strings over {a,b} with exactly two b’s.

Problem Set 3:
1. Construct a DFA over {a,b,c} where 'b' never appears before 'a'.
2. Construct a DFA over {a,b} that accepts strings containing at least two
a's and at most one b.
3. Construct a DFA that accepts binary strings that do not contain the
substring "1011".
4. Construct a DFA over {0,1} that accepts strings where the number of 0's
and 1's is equal.

You might also like