103) Finite state machine can recognize
Answer is:
only regular grammar
Related Theory of Computation MCQ with Answers
Answer is:
output of the former depends only on the present state
Answer is:
all of these
Explanation:
Any given transition graph has an equivalent
* regular expression
* DFSM
* NDFSM
Answer is:
Developing computers
Answer is: