Theory of Automata and Formal Languages MS Computer Science/MSc Computer Science/PhD Computer Science Islamia University Bhawalpur (IUB) 2017

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

No questions yet — be the first to ask.

See all

The Islamia Guibersity of ahabalpur

com

Glim Institute of Modern Studies

Departant Computer Science & IT

M63" Semester (Mid Term)

Course Code: CSIT-21304

Time: 50 min

Total Marks: 15

ustadni.com

Q No 2

ii.

1ii.

IV.

SHORT QUESTIONS

(08 = 2x4)

Consider the language S*, where S = (a, b}.How many words does this language

have of length 2 and of length 3?

Write a regular expression for a language of All strings in which the letter b is

never tripled. This means that noword contains the substring bbbE = {a, b}

Draw a deterministic finite automaton for language EVEN-EVEN

Let S = {a, bb, bab, abaab). Is abbabaabab in S*? Does any word in S* have an

odd total number of b's!

ALONG QUESTIONS

Q No 3Find the regular oxpression for the following finite autorata vith explanation of steps

you carry out.

(07)

ustadni.com

visit website: ustadni.com