Scribd
Upload
4 views1 page

Automata March 2021 Groupwork

The document is an assignment for the CSC 222 Automata Theory course at the University of Nairobi, dated March 10, 2021. It includes various tasks such as determining the truth of language statements, creating regular expressions, designing a DFA, and constructing finite automata for specific languages. The assignment covers languages defined over different alphabets and requires understanding of automata theory concepts.

Uploaded by

Jay D
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
4 views1 page

Automata March 2021 Groupwork

The document is an assignment for the CSC 222 Automata Theory course at the University of Nairobi, dated March 10, 2021. It includes various tasks such as determining the truth of language statements, creating regular expressions, designing a DFA, and constructing finite automata for specific languages. The assignment covers languages defined over different alphabets and requires understanding of automata theory concepts.

Uploaded by

Jay D
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

UNIVERSITY OF NAIROBI

SCHOOL OF COMPUTING & INFORMATICS

CSC 222 : AUTOMATA THEORY

Sit-in Group Work Assignment

DATE: 10th March 2021 TIME: 11.15 – 12.45

1. Given A = { a, b, c}, B = {b, c, d} and L₁={aibj} | i≥1,j≥1},


L₂={bicj| i≥j≥1}, L₃={aibjcidj| i≥1,j≥1} and L₄={(ad)iajdj| i≥2,j≥1}, determine whether
each of the following statements is true or false: (5 marks)
a. L₁ is a language over A f) L ₁ is a language over B b. L₂ is a language over A ∪ B
g) L₂ is a language over A ∩ B c. L ₃ is a language over A ∪ B h) L₃ is a language
over A ∩ B d. L ₄ is a language over A ⊕ B i) L₁ is a language over A-B e. L₁ ∪ L₂
is a language over A ∩ B j) L ₁ ∩ L₂ is a language over A ∪ B
2. Give regular expressions for the following languages defined over the alphabet Σ
= {a, b, c}: (6 marks)
a. All strings containing exactly one a.
b. All strings containing at least one occurrence of each symbol in Σ.

3. Determine a DFA, M accepting L, where L = {w ∈ {q,r}* : Every q in w has an r


immediately to its right}. (3 marks)

4. Obtain regular expressions for the languages defined over Σ = {0,1} given by a.
L1 = {02n12m+1 | n ≥ 0, m ≥ 0} (2 marks)
b. All strings which do not contain substrings of 0's of length greater than two. (2
marks)

5. For Σ = {a,b} construct FA's that accept the following set of strings: (6 marks) a.
all strings with exactly one 'a'.
b. all strings with at least one 'a'.
c. all strings with at least one 'a' and exactly two b's.

6. Determine the deterministic FA that accepts the language L(r), where r =


ab(a + ab* (a + aa)). (3 marks)

You might also like