(A) Incrementing
(B) Complementing
(C) Decrementing
(D) None of the given
Tag: Theory of Automata
In TG, there may be a transition for null string?
(A) True
(B) False
(C) Can’t show transition for string
(D) None of these
In drawing FA3 (which is equal to FA1 + FA2), a state will be declared final if?
(A) States of both FA’s are final
(B) At least one state is final
(C) Depends on language
(D) None of the given
In GTG’s there may exist no path for a certain string?
(A) True
(B) False
(C) Depends on alphabet
(D) None of these
In TG there may exist no paths for certain string?
(A) True
(B) False
(C) Depends on the language
(D) None of these
In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called?
(A) Dead States
(B) Waste Baskets
(C) Davey John Lockers
(D) All of these
Length of null string is?
(A) Always not equal to 0
(B) Always equal to 0
(C) It has variable length
(D) All are true
If in an NFA, ^ is allowed to be a label of an edge then that NFA is called __.
(A) Will not remain NFA
(B) NFA with
(C) NFA with null string
(D) Either “NFA with null string” OR “NFA with ”