Scribd
Upload
47 views1 page

Asg 1

This document provides the details of Assignment 1 for COMP 335 - Introduction to Theoretical Computer Science at Concordia University for the Fall 2018 semester. It consists of 7 questions worth a total of 70 marks. The questions cover topics such as language properties, regular expressions, finite automata, and regular languages. Students are instructed to show their work to receive full marks and that this is a theoretical course focusing on explanations.

Uploaded by

curiosity07
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
47 views1 page

Asg 1

This document provides the details of Assignment 1 for COMP 335 - Introduction to Theoretical Computer Science at Concordia University for the Fall 2018 semester. It consists of 7 questions worth a total of 70 marks. The questions cover topics such as language properties, regular expressions, finite automata, and regular languages. Students are instructed to show their work to receive full marks and that this is a theoretical course focusing on explanations.

Uploaded by

curiosity07
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

CONCORDIA UNIVERSITY

Dept. of Computer Science and Software Engineering


COMP 335 – Introduction to Theoretical Computer Science
Fall 2018

Assignment 1
Submission deadline: Thursday September 27th at 23:55

Note: This is a theoretical course. That means, while the WHAT is important, the WHY is
absolutely essential. Show the steps of your solution for the full mark.

Total mark is 70.

1. [10 Points] Let R and L be any languages over an alphabet Σ. Show the following
statements are true.
(a) L2 ⊆ L if and only if L = L+ .
(b) If L ⊆ R, then min{|x| : x ∈ L} ≥ min{|y| : y ∈ R}.
2. [10 Points] Suppose L1 and L2 are languages over an alphabet Σ. In each of the following
cases, find at least three instances of the languages for which the equality holds.
(a) L1 L2 = L2 .
(b) L1 Σ∗ = L1 .
3. [20 Points] For each of the following languages over Σ = {a, b}, design a DFA.

(a) L1 = {w : w ∈ Σ∗ , where w does not have bbb as a substring}.


(b) L2 = {w : w ∈ Σ∗ , where na (w) mod 3 = 0 and w begins with ab}.
(c) L3 = {vwv : v, w ∈ Σ∗ , and |v| = 2}.
(d) L4 = {am bn : mn > 4}.

4. [5 Points] Give a regular expression for (L1 ∪ L2 )L3 , where L1 , L2 , and L3 are the
languages defined in question 3 above.
5. [5 Points] Give a simple, verbal description of the complement of L = {an bn+1 : n ≥ 0}.
6. [10 Points] Let L be any regular language over an alpgabet Σ. Using L, we define
chop(L) = {w : ∃ x, y, z ∈ Σ∗ , xyz ∈ L, w = xz}.
Show that chop(L) is regular or give a counter-example.
7. [10 Points] Give a FA for L = L1 ∪ L̄3 , where L1 and L3 are languages defined in
question 3 above.
Extra homework, NOT marked: Give a DFA for L.

You might also like