Scribd
Upload
22 views1 page

FSM Mr-Sra1 Comuting Theory Homework # 1

The document contains 11 questions about designing DFAs and NFAs over various alphabets to accept certain string languages. The questions cover topics such as strings divisible by numbers, strings containing certain substrings, strings with constraints on symbol counts, and converting regular expressions to equivalent NFAs. The document also asks to show that three specific languages are not regular.

Uploaded by

Niaré Adama
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
22 views1 page

FSM Mr-Sra1 Comuting Theory Homework # 1

The document contains 11 questions about designing DFAs and NFAs over various alphabets to accept certain string languages. The questions cover topics such as strings divisible by numbers, strings containing certain substrings, strings with constraints on symbol counts, and converting regular expressions to equivalent NFAs. The document also asks to show that three specific languages are not regular.

Uploaded by

Niaré Adama
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

FSM MR-SRA1

Comuting Theory Homework # 1

Question 1
Design a DFA over Σ = {0, 1} that accepts all strings which are divisible by 3 when converted to decimal.

Question 2
Design a DFA over Σ = {0, 1} that accepts all strings which are divisible by 4 when converted to decimal.

Question 4
Design a DFA over Σ = {a, b} that accepts all strings which contain aba as a substring and does not end
with ba.

Question 5
Design an NFA over Σ = {0, 1} that accepts all strings which are divisible by 3 when converted to decimal
or the number of 1s is divisible by 4.

Question 6
Design an NFA (not a DFA) that accepts all string over the alphabet {0, 1} in which the sum of the last
three digits is odd.

Question 7
Design an NFA for the following language:
L = {0k | k is a multiple of 2 or 3 }

Question 8
Transform the following regular expression into an equivalent NFA: (0 ∪ 0∗ 1)

Question 9
Show that the following language is not regular: {02k 1i 0j | i + j < 2k}

Question 10
Show that the following language is not regular: {0k 1i 0j | i + j < k}

Question 11
Show that the following language is not regular: {w | w ∈ {0, 1}∗ } such that the number of 0s is twice the
number of 1’s

You might also like