(A) Finite Automaton
(B) TG
(C) GTG
(D) None of these
Tag: Theory of Automata
TG is always deterministic?
(A) True
(B) False
(C) NA
(D) NA
“Every Infinite language is regular” this statement is?
(A) True
(B) False
(C) NA
(D) NA
Length of strings, generated by infinite language is__.
(A) finite
(B) infinite
(C) Depends on the language
(D) none of these
Using tree structure final state represent by?
(A) *
(B) –
(C) double circle
(D) None of given
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