Scribd
Upload
66 views

Assignment 1-1

This document assigns a group project on formal languages and automata theory. It contains 11 questions divided into 2 sections - subjective and workout questions. The questions cover topics on formal vs informal languages, deterministic vs nondeterministic finite automata, regular vs context-free languages, grammars, and automata constructions. It also assigns the 5 groups to specific questions for the group assignment and is due on February 19, 2022.

Uploaded by

muhaba Adege
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
66 views

Assignment 1-1

This document assigns a group project on formal languages and automata theory. It contains 11 questions divided into 2 sections - subjective and workout questions. The questions cover topics on formal vs informal languages, deterministic vs nondeterministic finite automata, regular vs context-free languages, grammars, and automata constructions. It also assigns the 5 groups to specific questions for the group assignment and is due on February 19, 2022.

Uploaded by

muhaba Adege
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Wachemo University

College of Engineering and Technology


School of Computing and Informatics
Department of Computer Science
Group Assignment
Course: Formal Languages and Automata Theory
Program: Evening & Weekend
Year/Sem: III/I
Deadline: February 19, 2022
I. Subjective Form of Questions
1. What is the difference between Formal Language and Informal Language in terms of Computer
Science? Give your Examples.
2. Compare and Contrast Deterministic and Nondeterministic Finite Automata, with examples
3. Discuss Regular Languages and Context Free Languages with comparison and examples.
4. Discuss Regular Grammar, Context Free Grammar, and Context Sensitive Grammar with
comparison and examples.
5. Discuss Recursive Languages and Recursively Enumerable Languages with its automation.
II. Workout Questions
1. Find grammars for ∑ = {a, b} that generate the sets of
a. All strings with exactly one a.
b. strings with at least one a.
c. all strings with no more than three a’s.
d. all strings with at least three a’s.
e. All strings with at least one a and exactly b’s.
2. Let ∑ = {a, b}. For each of the following languages, find a grammar that generates it.
(a) L1= {anbm: n>=0, m>n}
(b) L2= {anb2n: n>=0}
(c) L3= {an+2bn : n>=1}
(d) L4={anbn-3 : n>=3}
(e) L5={anbm+2 : n>=0, m>n}
3. Give DFA for questions number II(1)and II(2).
4. Write regular expressions for the following languages on {0, 1}.
(a) All strings ending in 01,
(b) All strings not ending in 01,
(c) all strings containing an even number of 0’s,
(d) all strings having at least two occurrences of the substring 00. (Note that with
the usual interpretation of a substring, 000 contains two such occurrences),
(e) all strings with at most two occurrences of the substring 00.
5. Give an NFA that accepts the language L((a + b)*b(a+bb)*) and its equivalent DFA.
(Note: Your answer should be unique)
6. Find context-free grammars for the following languages (with n>=0, m>=0, k>=0).

7. Eliminate useless productions from:(NOTE: Show the steps correctly)

8. Give the Pushdown Automata for the question number 6.


9. Remove all unit-productions, all useless productions, and all NULL-productions from
the grammar:

What language does the grammar generates?


10. Construct NPDA's that accept the following languages on ∑={a,b, c}.

11. Construct Turing machines that will accept the following languages on {a,b}.
Group and Questions Distribution
Group➔ G-1 G-2 G-3 G-4 G-5
Questions➔ I(1)& I(2)& I(3)& I4)& I(5)& II(1e,2a,3,
II(1a,2e,3, II(1b,2d,3, II(1c,2c,3, II(1d,2b,3, 4e,5,6e,7,8,9,10a
4b,5,6a,7,8, 4a,5,6b,7,8, 4d,5,6c,7,8, 4c,5,6d,7,8, ,11e)
9,10e,11a) 9,10d,11b) 9,10c,11c) 9,10b,11d)

You might also like