COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
* Q
|
|
|
Q * Q
|
|
|
*
|
|
|
Q *
|
Detailed explanation-1: -In the case of a manifold, a transition function is a map from one coordinate chart to another. Therefore, in a sense, a manifold is composed of coordinate charts, and the glue that holds them together is the transition functions.
Detailed explanation-2: -The transition function can be represented as T(current state, current input symbol) next state. For instance if q0 is the current state and 0 is the current input symbol, then the transition function is T(q0, 0) q1.
Detailed explanation-3: -The transition function is also called a next state function meaning that the automaton moves into the state (q, a) if it receives the input symbol a while in state q. Thus in the example of vending machine, if q is the initial state and a nickel is put in, then (q, a) is equal to “have received 5 cents".
Detailed explanation-4: -10. RR* can be expressed in which of the forms:a) R+b) R-c) R+ U R-d) RView AnswerAnswer: aExplanation: RR*=R+ as R+ means the occurrence to be at least once.