Automata transformation resource estimator

Family 129: Exponential state costs for two-way automata. First review, 8 October 2026.

Problem and potential new use

Compiler teams can identify transformations that may cause exponential state blowups and decide when to retain a richer representation.

Applicability and commercial boundary

Worst-case alphabet-growing examples do not prove a particular parser or finite-alphabet transform will explode. The theorem does not imply every regex operation has this cost.

Initial business decision

Research infrastructure. Buyer demand and profitability remain hypotheses. This first pass does not establish a validated commercial market.

Next verification action

Review the concrete automata models and build an explicit family showing the claimed state tradeoff.

Evidence scope

Catalog statement reviewed; inspect linked opportunity dossier for any deeper source review. This record alone does not establish full manuscript or proof verification.

Source revision fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb. See source metadata for the exact manuscripts and available scope notes.