Why_there_is_a_need_to_‚Äö√Ñ√∂‚àö√ë‚àö‚à´Check_that_transitions_to_several_concurrent_sub-states_go_through_a_fork‚Äö√Ñ√∂‚àö√ë‚àöœÄ?$#

Question

TuteeHUB · Accepted Answer

All of the mentioned

TuteeHUB · Answer

State diagrams must specify deterministic finite automata, so there can be no doubt which transition to follow under every possible circumstance

TuteeHUB · Answer

It is illegal to transition directly to more than one sub-state of a concurrent composite state without going through a fork

TuteeHUB · Answer

None of the mentioned

1.	Why_there_is_a_need_to_‚Äö√Ñ√∂‚àö√ë‚àö‚à´Check_that_transitions_to_several_concurrent_sub-states_go_through_a_fork‚Äö√Ñ√∂‚àö√ë‚àöœÄ?$#
A.	State diagrams must specify deterministic finite automata, so there can be no doubt which transition to follow under every possible circumstance
B.	It is illegal to transition directly to more than one sub-state of a concurrent composite state without going through a fork
C.	All of the mentioned
D.	None of the mentioned
Answer» C. All of the mentioned

Discussion