(A) static and change queries
(B) static and action queries
(C) select and action queries
(D) select and change queries
In FA one enter in specific stat but there is no way to leave it then state is called?
(A) Dead States
(B) Waste Baskets
(C) Davey John Lockers
(D) All of above
In FA final state represent by __sign.
(A) +
(B) –
(C) =
(D) *
The clouser FA*(star on an FA ) always accept __string.
(A) Null
(B) aa
(C) bb
(D) None of given
TG can more then one initial state?
(A) True
(B) False
(C) Depend on alphabets
(D) None of given
One language can represents more than one RE?
(A) True
(B) Falss
(C) Can’t be assumed
(D) Non of given
S={a,bb,bab,baabb} set of strings then S* will not have?
(A) baba
(B) baabbab
(C) bbaaabb
(D) bbbaabaabb
S= {a,bc,cc} has the latters?
(A) 1
(B) 2
(C) 3
(D) 4