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