Posts

Showing posts from April 18, 2010

TOC Question Paper Unit - II C

MCA SEM II Subject Code: 620007      Subject Name: Theory of Computation UNIT – II Question List -C
Q.1 (a) Do as Directed.


(i)Define Regular Languages and Regular Expression over Σ 2

(ii)Give the Regular Expression for The Language of C identifiers. 1

(iii)List out any three Application of Regular Expression. 1

(iv)What is the Precedence order for Regular Expression? 1
(b) Draw the FA for all strings over {0, 1} that begin and end with 111. 5 Q.2 (a)

TOC Question Paper Unit - II B

MCA SEM II Subject Code: 620007      Subject Name: Theory of Computation UNIT – II Question List -B
Q.1 (a) Do as Directed.


(i)Given the two Regular Expressions. r = 0* + 1* s = 01* + 10* + 1*0 + (0*1)*              (1) Find the string corresponding to r and s.              (2) Find the string corresponding neither to r nor to s. 2

(ii)Explain the Language for given. (1) 0*1 (0*10*1)* 0*.               (2) (1+01)* (Λ+0+00) (1+10)* 2

(iii)Find the String that is not in Language Represented by Regular Expression a*(ab)*b* and string should be shortest. 1

TOC Question Paper Unit - II A

MCA SEM II Subject Code: 620007      Subject Name: Theory of Computation UNIT – II Question List -A
Q.1 (a) Do as Directed.


(i)Given the two Regular Expressions. r = 0* + 1* s = 01* + 10* + 1*0 + (0*1)*               (1) Find the string corresponding to r but not to s.               (2) Find the string corresponding to s but not to r. 2

(ii)Find the Regular Expression for given. (1)All String that do not end with 01. (2)All String that contain no more than one occurrence of the string 00. (3)All String that contains exactly two 0’s. 3
(b)

Assignment – 8 Regular Language & Finite Automata

B. H. Gardi College of Engineering and Technology,Rajkot Department of MCA MCA Semester – II Subject: 620007 – Theory of Computation
Assignment – 8 Regular Language & Finite Automata
Date: 17-Apr-2010

1 Regular Language 2 Regular Expression 3 Regular Language & Regular Expression Over Σ 4 Finite Automata / FiniteState Machine / DFA 5 Transition Table 6 Types of State 7 Transition Diagram 8 Transition Function ( δ ) 9 Extended Transition Function ( δ* ) 10 String Accepted by FA 11 String Rejected by FA 12 Regular Language ( In Context of  FA) 13 Distinguishable String With Respect To Language


Note:Write all Answers with Example.