Theory of Automata and Formal Languages B.B.S. UOS — University of Sargodha 2015

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.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ayesha Mustafa· 5 days ago

BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

0 replies Reply →
Abubakar· 5 days ago

Literary criticism

1 reply Reply →
Guest· 5 days ago

this paper consists of 60 marks but now we have 35 marks paper.

1 reply Reply →
Annie· 6 days ago

Can you please tell me more past papers please because my exams are starting from next week

1 reply Reply →
Ahmed· 10 days ago

Did you provide the past papers of the science of society uos?

1 reply Reply →

See all

University of Sargodha

Subject: Theory of Automata

Eeb.12、2015

Total Marks: 60

Time Allowed: 129 minute

false. Give examples that support your answer.

2) Prove that CFG is more powerful than finite automara with exampie.

Q: 2 Write CFG's for the following languages over the alphabet 2 -(a.b) (10 Marks]

" Language of all the words that do not have substring "bbS".

b) L- (ab / / jand i.1≥0}

Design a PDA for the following language

a) L- {a'b"/ i>0} |8 Marks]

b) When L11.2 contain all the words of both the languages. [2 marks!

a) Usine getaine lenma show tha (a6%**) is a non regular language (7 Marks)

b) What is meant by an ambiguous.

Ustatipimar? /3 marks]

as Let's define a new language hif egal. This language cos at sings with mumber

of a's is half the number of b's. Design a turing machine that recognizes the half qual

language. [10 Marks]

visit website: ustani.pk