Scribd
Upload
5 views1 page

Automata Tut1

AUTOMATA

Uploaded by

onezoro0909
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
5 views1 page

Automata Tut1

AUTOMATA

Uploaded by

onezoro0909
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/ 1

Automata Theory and Computability

Tutorial 1

1. Let L = {ab, aa, baa}. Which of the following strings are in L∗ .


A abaabaaabaa
B aaaabaaaa
C baaaaabaaaab
D baaaaabaa

Figure 1: An example DFA

2. Which of the following string(s) will not be accepted by the DFA in the Figure 1.

A 000000101
B 01110000001
C 010
D 000010
E 000011111
F 101

3. Construct a DFA which accepts the set of all strings over {a,b} where each strings starts with ‘a’.
4. Construct a DFA which accepts the set of all strings over {a,b} where each strings ends with ‘a’.
5. Construct a DFA which accepts the set of all strings over {a,b} where each strings starts with ‘ab’.
6. Design a DFA over Σ = {0, 1} which ends with 100.
7. Design a DFA over Σ = {a, b} which starts with ’a’ and ends with ’b’.
8. Design a DFA over Σ = {a, b} which contains ’ab’ as a substring.
9. Construct a DFA which accepts the set of all strings over {a,b} where each strings starts and ends with
same symbols. (meaning if starts with ‘a’ it should ends with ‘a’ and vice versa)
10. Construct a DFA which accepts the set of all strings over {a,b} where each strings starts and ends with
different symbols. (meaning if starts with ‘a’ it should ends with b and vice versa).

You might also like