A state from which a deterministic finite state automata can never com – McqOptions

MCQOPTIONS

1.	A state from which a deterministic finite state automata can never come out is called a ____________.
A.	trape state
B.	starting symbol
C.	transition table
D.	transition diagram
Answer» B. starting symbol

Discussion

No Comment Found

Related MCQs

For m = 1, 2, , 4m+2 is a multiple of is known as
For any integer m>=3, the series 2+4+6+ +(4m) can be equivalent to
Let domain of m includes all students, P (m) be the statement m spends more than 2 hours in playing polo . Express m P (m) quantification in English.
What rules of inference are used in this argument? All students in this science class has taken a course in physics and Marry is a student in this class imply the conclusion Marry has taken a course in physics.
What rules of inference are used in this argument? It is either colder than Himalaya today or the pollution is harmful. It is hotter than Himalaya today. Therefore, the pollution is harmful.
What rules of inference are used in this argument? Jay is an awesome student. Jay is also a good dancer. Therefore, Jay is an awesome student and a good dancer.
Let R and S be two relations on a set of positive integers I. If R = {(a, 3a+a)},S = {(a,a+a)} then R composition R composition R = __________.
A partial order is defined on the set S = {x, b1, b2, bn, y} as x bi for all i and bi y for all i, where n 1. The number of total orders on the set S which contain the partial order is
Let P: We should be honest., Q: We should be dedicated., R: We should be overconfident. Then We should be honest or dedicated but not overconfident. Is best represented by?
A relation R is defined on the set of integers as xRy if and only if (x+y) is even. Which of the following statement is TRUE?