CS402 – Current Mid term

- Spring 2016
(Choose the correct answer for each question)

1. If FA corresponds to (a+b)* then FA1 must a ccept __________ string

a-odd length b-e ven

2. Every FA should be _____

a.determinis tic b. nondeterministic

3. GTG can have at least _____ intial stages

a.1 b.2 c.3 d.4

3. FA1 and FA 2 have maximum _____ initia l stages

5.In case of finite automation, there ____ be transition on each _____ for every
Mus
lettert,ofsta te
alphabet set
State, must

6.If a TG has more than 1 start sta tes then w e can make a ______
Single par t
Double part

7.In FA , if one enters in a specific state, w hen there is no w ay to leave

Dead state
Waste basket
All of these

8.FA and NFA are = if

Both accep t same langua ge
NFA eliminated from non-dete rminis tic

9. is not a valid trans ition in _____

RE
10. NFA
FA
NFA
.Sub jective
in null
questions
stringfrom
usually
diaexpressed
grams of changing
as_____ state s
: