Scribd
Upload
79 views

Automata Theory. Exercise 1 Due - Feb 9: All Answers Should Be Proved Formally (Unless Noted Otherwise)

This document contains instructions for an assignment on automata theory. It includes 4 questions - the first asks to describe the language of an automaton and prove the answer formally. The next 3 questions ask to describe deterministic finite automata for various languages over the alphabet {0,1}. The last question asks to prove 3 theorems about properties of regular languages.

Uploaded by

Ahmad Suliman
Copyright
© Attribution Non-Commercial (BY-NC)
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
79 views

Automata Theory. Exercise 1 Due - Feb 9: All Answers Should Be Proved Formally (Unless Noted Otherwise)

This document contains instructions for an assignment on automata theory. It includes 4 questions - the first asks to describe the language of an automaton and prove the answer formally. The next 3 questions ask to describe deterministic finite automata for various languages over the alphabet {0,1}. The last question asks to prove 3 theorems about properties of regular languages.

Uploaded by

Ahmad Suliman
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 2

Automata Theory.

Exercise 1 Due Feb 9


All answers should be proved formally (unless noted otherwise)

1. What is the language of the automaton below? (remember to prove your answer formally.)

2. Describe a deterministic finite automaton (a.k.a. DFA), for each of the following languages. A drawing can be considered a description, but only if it is exact and contains all the information needed to create from it the formal definition of the automaton. No need to prove formally the correctness of your construction. All languages are over the alphabet = {0, 1}. (a) The language that contains all words that end with 0111. (b) The language that contains all words that begin with 0111. (c) The language that contains all words that contain 0111 as a subword. (d) The language that contains all words that do not contain 0111 as a subword.

3. The binary representation of a number is a word of the alphabet {0, 1}. The value of the word s = s1 . . . sn, denoted v(s), is defined as follows: For the empty word, v() = 0. For a longer word, the definition is inductive v(s1 . . . sn1sn) = 2 v(s1 . . . sn1) + sn. Note that this means that

Describe a DFA that recognizes binary words that their value mod 3 is 0. Theorem 4. Prove the following theorems: 1) The class of regular languages is closed under union. 2) The class of regular languages is closed under concatenation.

3) The class of regular languages is closed under star operation.

You might also like