Tag
state-explosion
- Aug 26, 2026 Exhaustive State Exploration and What a Bounded Model Proves How model checking enumerates reachable states, why a bound is a parameter of the claim rather than a shortcut, and how to read a counterexample as a requirement defect. software engineering
- Jan 5, 2026 Alternating Automata: Universal Branching and the Cost of Free Complementation What happens when a state may demand that all successors accept rather than one, how the acceptance game is played, and why one-way alternation shrinks descriptions without changing the exponential determinization bound. computation theory
- May 6, 2025 Where the 2^n Comes From: Subset Construction and the Limits of Determinization Why determinizing an n-state NFA can require exponentially many states, how to exhibit a language that forces the blow-up, and which partial determinization schemes keep it bounded in practice. computation theory