13 views

Uploaded by Mohammed Fadhl Albadwi

theory of computation

- DVA337-HT17-lecture5.pdf
- Chapter 13.1. LL Parsing
- mid1-sol
- Recursive-descent-parsing
- Color Lecture Notes
- Design and Construction of Compilers
- Binary Pattern Detector
- computerscience (2)
- Normal Forms
- FAT Model Qp
- A Computational Survey of the Cerny and Pin conjectures
- LECTURE B 4 FSM Encoding Intro
- ECE 3561 - Lecture 10 State Machine Design Topics.pptvggh
- LECTURE B 1 FSM Minimization Intro
- Regulation2004 Sylabus.pdf
- m2014
- Theory of Computation
- Digita Questions
- Chapter 3c
- CSC3113_Lec02

You are on page 1of 4

**) Subject: Automata & Computation Date: / 2 /2009 Class: B3CS/B3CSE Time: 2 hours ________________________________________________________________________________
**

ANSWER ANY FOUR QUESTIONS

1#

(a) Consider the Right linear grammar A 1A A 00 B B 1 Construct an equivalent Deterministic Finite Automata, for this grammar. (b) Give a Context Free Grammar that can generate the following language, L = { ax bx / x ≥0}

2#

(a) Construct DFA’s equivalent to the following NFA using the Direct method. Give the reduced table.

ε A ε D ε

B

1

C ε ε

ε F

0

E ε

0

G

H

(b)

Construct Regular Expression for the language with all words that do not end in a double letters

3# (a) Design a Mealy machine for the following process, “ For input from (0+1)*, if the input ends in 11, output “TWO”; if the input ends in 000, output “THREE”; otherwise output “OK” . (b) Convert the machine into an equivalent MOORE machine.

0/Y 1/Y

A

1/N

B C

0/N 1/N

D

0/Y

1/N 0/Y

. (i) 00 + ( 10 + 1 ) 0* + 1 (ii) ( 0 0* + 1 )* 5# (a) Design Turing machine which calculate the value ( x + 2 ). A a a B b C b 1 E (b) Consider the grammar : S aB A bAA S bA Bb A a B bS A aS B aBB For the strings abbaba. (i) The set of all strings ending with 10. rightmost derivation.1}. (ii) The set of all strings of length 2 or more. Construct the reduced table.4# (a) Derive the equivalent Regular Expression for the given Finite Automata. تمنياتي لكم بالتوفيق . give the leftmost derivation. (b) For each of the following languages. give a deterministic finite automaton which accept the language over the alphabet {0. 6# (a) Give a Right and Left linear grammars equivalent to. A 0 1 B 0 C 1 1 0 E (b) Construct deterministic finite automata equivalent to the following regular expressions. and the parse trees.

S aB A bAA S bA Bb A a B bS A aS B aBB For the strings aaabaaa.سم هللا الرحمن الرحيم ب University of Aden Faculty of Engineering Odd Semester Final Re_examination (2008-2009) Subject: Automata & Computation Date: / /2009 Class: B3CS/B3CSE Time: 2 hours -------------------------------------------------------------------------ANSWER ANY FOUR QUESTIONS 1# (a) Design a Moore machine for the following process: if the input ends in 0. T. output A. if the input ends in 00. and the Parse trees. 2# (a) Give a Context Free Grammar generating the following language. otherwise output D. (a b c) + (( a + b* + c ) a*) (b) Find the Right and the Left Linear Regular Grammars for the following Regular Expressions: (i) ( a + b) a* . 3# (a) Construct a Deterministic Finite Automata DFA equivalent to the following regular expressions.” (b) Covert the above design to the equivalent Mealy machine. Right_Most Derivation. give the Left_Most Derivation. P. S) . output B. j ≥ 1} (b) Consider the grammar G =( V. (ii) (01)* 00 . L = { 0i 1i 2j / i ≥ 0 . if the input ends in 000 output C.

which accepts the languages defined by the following Regular Expressions: a (i) ( a b b a* )* (ii) (ii) (001) + (( 1 + 0* + 1 ) 1*) 6# (a) Convert the following machine to MOORE machine. (b) Draw a NFA. a/0 b/1 a/1 A b/1 B b/0 C a/0 (b) Construct Regular Expression for the language with all words that do end in a double letters تمنياتي لكم بالتوفيق . 0 0 0 A 1 B 1 C 0 D (b) Give the equivalent Right linear regular grammar for the following DFA. A 0 E 0 1 B 1 C 1 5# (a) Design Turing machine to find 2’s complement of a given binary number.4# (a) Derive the equivalent Regular Expression for the given Finite Automata.

- DVA337-HT17-lecture5.pdfUploaded byKamal Walia
- Chapter 13.1. LL ParsingUploaded bykims3515354178
- mid1-solUploaded byepicphail9000
- Recursive-descent-parsingUploaded byOmar Alejandro Lopez Ortega
- Color Lecture NotesUploaded byazarahamed
- Design and Construction of CompilersUploaded byapi-3725159
- Binary Pattern DetectorUploaded byBangon Kali
- computerscience (2)Uploaded byonesnone
- Normal FormsUploaded byParthPahwa
- FAT Model QpUploaded byNikhilesh Prabhakar
- A Computational Survey of the Cerny and Pin conjecturesUploaded bymjm
- LECTURE B 4 FSM Encoding IntroUploaded byxxqwertyxx
- ECE 3561 - Lecture 10 State Machine Design Topics.pptvgghUploaded byhub23
- LECTURE B 1 FSM Minimization IntroUploaded bySathish Kumar
- Regulation2004 Sylabus.pdfUploaded bySomasundaram Ramu
- m2014Uploaded byG/her
- Theory of ComputationUploaded bystarvit2
- Digita QuestionsUploaded byMani Kiran
- Chapter 3cUploaded byDaryl Ivan Hisola
- CSC3113_Lec02Uploaded byS M Akash
- Catalyst 4500 Series Switch IOS Command ReferenceUploaded bymao200867
- 04 the Development of Multi Agent System Using Finite State MachineUploaded byWan Muhd Syafiq
- Automated Review of Natural Language Requirements DocumentsUploaded byCarlos Jaramillo
- Digital Design QuestionsUploaded bynarasimharao
- TLComp-introTLUploaded byAko Cee Jay
- cs431ch2rvwUploaded bysihag_deepak
- Description JavaUploaded bySasa Leung
- PerlUploaded bysubzero810
- 01 Introduction 1Uploaded byplasa88
- AutomataTheoryandLanguages.pdfUploaded byChristopherLim

- PrologLabs_4Uploaded byMohammed Fadhl Albadwi
- PrologLabs_4Uploaded byMohammed Fadhl Albadwi
- PrologLabs_3Uploaded byMohammed Fadhl Albadwi
- JavaLabs8Uploaded byMohammed Fadhl Albadwi
- JavaLabs2Uploaded byMohammed Fadhl Albadwi
- JavaLabs5Uploaded byMohammed Fadhl Albadwi
- Lab8_Negative.pdfUploaded byMohammed Fadhl Albadwi
- Netduino PlusUploaded byMohammed Fadhl Albadwi
- AI Exam Jan2014Uploaded byMohammed Fadhl Albadwi
- Lab6_SetPixel.pdfUploaded byMohammed Fadhl Albadwi
- JavaLabs3.pdfUploaded byMohammed Fadhl Albadwi
- JavaLabs7Uploaded byMohammed Fadhl Albadwi
- Java StringUploaded byMohammed Fadhl Albadwi
- JavaLabs6Uploaded byMohammed Fadhl Albadwi
- PrologLabs_5Uploaded byMohammed Fadhl Albadwi
- Design of Sequential CircuitsUploaded byMohammed Fadhl Albadwi
- Design of Sequential CircuitsUploaded byMohammed Fadhl Albadwi
- C#_Lab2Uploaded byMohammed Fadhl Albadwi
- Lab10 IndexedUploaded byMohammed Fadhl Albadwi
- Lab10 IndexedUploaded byMohammed Fadhl Albadwi
- AlgorProblems.pdfUploaded byMohammed Fadhl Albadwi
- C#Lab1Uploaded byMohammed Fadhl Albadwi
- Lab8_Negative.pdfUploaded byMohammed Fadhl Albadwi
- Lab8_Negative.pdfUploaded byMohammed Fadhl Albadwi
- Lab6_SetPixel.pdfUploaded byMohammed Fadhl Albadwi
- Graphic ShearUploaded byMohammed Fadhl Albadwi
- C#_Lab3Uploaded byMohammed Fadhl Albadwi
- ReExam_InbKha_discrete.pdfUploaded byMohammed Fadhl Albadwi
- ReExam_InbKha_discrete.pdfUploaded byMohammed Fadhl Albadwi
- Image HueUploaded byMohammed Fadhl Albadwi

- Keterangan Epsilon-nfa Ke Dfa Rev 1Uploaded bycha
- ACD-11..Uploaded byNarahari Kandlakunta
- Uptu B.tech 2nd Year SyllabusUploaded byPrakash Kumar
- ACM Sistema de ClasificaciónUploaded byIván Soria Solís
- 38656052-Chapter-15Uploaded bykirtyd
- 04DE_RetiPetriUploaded byTigabu Yaya
- sylabusUploaded byRalph Chester Sagrado Cullado
- MDU B.tech Computer Science 4th Sem SyllabusUploaded byVaibhav Agochiya
- (Lecture Notes in Computer Science 7907) Rūsiņš Freivalds (Auth.), Marie-Pierre Béal, Olivier Carton (Eds.)-Developments in Language Theory_ 17th International Conference, DLT 2013, Marne-la-Vallée, FUploaded byMARCO
- IT FINAL YEAR SYLLABUSUploaded byPRIYA RAJI
- abbacs800cranecontrolmanualn697Uploaded byivan
- Design and Embedded Control SystemsUploaded bygomesjunior2002
- Gladiator Custom Design CenterUploaded byCesarsanfelice
- rhs solver for fpgaUploaded byArvind Sudarsanam
- MIT6_005f08_lec04Uploaded bySreenivas Reddy G
- Module01a Intorduction and ModelsUploaded byFrank Wang
- umlfm_telecomparistech.pdfUploaded bysajjadali838
- Minimizing Finite AutomataUploaded byAnkit Aggarwal
- Unity AI Game Programming - Second Edition - Sample ChapterUploaded byPackt Publishing
- carte cid.pdfUploaded byMass
- Debugging of Verilog Hardware Designs on DE2Uploaded byCharismaztex
- 2-1 cseUploaded byManasa Chitturi
- Final f03 SolUploaded byhuyeb
- Python Lab.docUploaded byShikha Arya
- Ejercicios CLAD V1.1Uploaded byRay Juarez Saldaña
- Chapter 04. AutomataUploaded bykims3515354178
- MphilUploaded bydevarasuthillai
- Recognition of TokensUploaded byVasantha Kumari
- Kinber, Efim _ Theory of ComputingUploaded byMusic Shake
- Finite State MachineUploaded bythecodefactory