If a finite state machine table lacks unreachable states, which consequence follows?

💡 Explanation

When a finite state machine's transition table contains no unreachable states, it means every state can be potentially visited, because a path exists from the initial state; therefore, 'all states are potentially reachable' is correct, rather than any state becoming infinitely looped or prematurely halting.

• If a line-sweep algorithm computes the convex hull of points representing server locations and encounters an event point, which consequence follows?
• What happens to the available call stack memory when a recursive function lacks a proper base case in a system controlling an autonomous drone?
• If a robotic arm's control system uses modular arithmetic for precise positioning, which consequence results when a large prime number is chosen as the modulus?
• In a simulation of the Towers of Hanoi with 'n' disks, what happens to the number of moves required as the simulation hits the base case (n=1)?
• A database search algorithm is designed to locate a specific record among 'n' entries. What happens to the worst-case execution time as 'n' doubles?
• If a database system's query optimizer relies solely on set theory's laws for simplification, which outcome occurs when evaluating a complex query with multiple joins and intersections?