Sheet 1

Name: Mohamed Ahsraf Ahmed

ID: 2020030157

1- Briefly explain the three major fundamental areas of theory of

computers ?

1-Automata theory:
Automata theory is the study of abstract machines (or more appropriately,
abstract 'mathematical' machines or systems) and the computational problems
that can be solved using these machines. These abstract machines are called
automata.

2-Formal Language theory:

Language theory is a branch of mathematics concerned with describing
languages as a set of operations over an alphabet. It is closely linked with
automata theory, as automata are used to generate and recognize formal
languages.

3-Computability theory:
Computability theory deals primarily with the question of the extent to which a
problem is solvable on a computer. 

2- Define the following expressions ?

1-Theory of computer : The Theory of Computation is a branch of computer science and mathematics
that focuses on determining problems that can be solved mechanically, using an algorithm or a set of
programming rules. It is also concerned with the efficiency at which the algorithm can perform the
solution.

2-alphabet : a set of letters or other characters with which one or more languages are written especially
if arranged in a customary order

3-language : A language is a system of communication which consists of a set of words and alphabets.

4-formal : relating to or involving the outward form, structure, relationships, or arrangement of elements
rather than content.

5-word : a unit of language, consisting of one or more alphabet.

6-empty string : it’s a string haven’t any alphabets.
7-length of string : it’s the number of the alphabets in the string.
8-reverse of string : Reversing a string is the technique that reverses or changes the order of a
given string so that the last character of the string becomes the first character of the string and
so on.
9-PALINDROME : it’s the string that if you read it from the first or the last give you the same result .
10-closure of the alphabet: we define a language in which any string of letters from is a word ,even the
null string . We call this language the closure of the alphabet.

3- What is that symbols mean:

1- Λ : Empty string.
2- + : {1,2,3,………}.
3- Σ : Is a finite set of symbols, called the alphabet of the automaton.
4- Σ* : The set of all strings over an alphabet Σ .
5- Σ + : The set of all strings over an alphabet Σ except Λ.
6- S : language.
7- S* : The set of all strings over an language.
8- Ф : Empty language

4- Consider the language S*, where S = {a, b}. How many words does this language have of length 2?
of length 5? of length n?
Length 2 = 4 words {aa, ab, bb, ba}
length 5 = 32 words {aaaaa, aaaab, aaaba, aabaa, abaaa, aaabb, aabba, abbaa, aabbb, abbba, abbbb,
bbbbb, bbbba, bbbab, bbabb, babbb, bbbaa, bbaab, baabb, bbaaa, baaab, baaaa, ababa, babab,
abbab, baaba, ababb, babaa, bbaba aabab }
length n = n words .

5- Consider the language S*, where S = {aa, b}. How many words does this language have of length 4?
of length 5? of length 6? What can be said in general?
Length 4 = 5 words {aaaa, aabb, bbbb, bbaa, baab}
length 5 = 8 words {aaaab, aabaa, aabbb, bbbbb, bbbaa, bbaab, baabb, baaaa}
length 6 = 10 words {aaaaaa, aaaabb, aabbaa, aabbbb, bbbbbb, bbbbaa, bbbaab, bbaabb, baabbb
bbaaaa}

6- Consider the language S*, where S = {ab, ba}. Write out all the words in S* that has seven or fewer
letters. Can any word in this language contain the substring aaa or bbb?
= { Λ, ab, ba, abab, baba, abba, baab, ababab, ababba, abbaab, bababa, babaab, baabba}
no there is no word contain the substring aaa or bbb.
 7- Consider the language S*, where S = {a, ab, ba}. Is the string (abbba) a word in this language?
Write out all the words in this language with 7 or fewer letters. What is another way in which to describe
the words in this language?
- this string (abbba) is not a word in this language.
- { Λ, a, ab, ba, aa, aab, aba, baa, aabba, abaab, baaab, abbaa, ababa, abababa, ababaab, abaabab,
aababab, bababaa, babaaba, baababa, abababa, ababbaa, abbaaba, baabbaa, aababba, aabbaab}
- a* (ab+ba)*

8- Consider the language S*, where S = {aa, aba, baa}. Shows that the words: aabaa, baaabaaa, and
baaaaababaaaa are all in this language. Can any word in this language be interpreted as string of
elements from S into different ways? Can any word in this language have an odd total number of a’s?
- Yes, all of this words in this language.
-NO
-NO, there is no word in this language have an odd number of a’s.

9- Consider the language S*, where S = {xx, xxx}. In how many ways can x19 be written as the product
of words in S? This means: how many different factorizations are there of x19 into xx and xxx?
- there is 2^19 ways .

10- Consider the language S = {a, bb, bab, abaab}. Is abbabaabab in S*? Is abaabbabbaabb in S*?
Does any words in S* have an odd total number of b’s?
-(abbabaabab) not in S*.
-(abaabbabbaabb)not in S*.
-no there is no word have an odd total number of b’s.

11-Consider the language S*, where S = {aa, ab, ba, bb}. Give another description of this language.
Give an example of a set S such that S* only contains all possible strings of a’s and b’s that have length
divisible by 3.
- aa*(ab+ba)*bb*
-{aaaaaa, ababab, bababa, bbbbbb, aaabba, aaabbb, bbbaab, ………..}