The worst-case state complexity of exact strict-cutpoint simulation of n-state 1gQFA by one-way PFAs is Theta(n squared).
Generalized Automata and Stochastic Languages
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
The worst-case state complexity of exact strict-cutpoint simulation of n-state 1gQFA by one-way PFAs is Theta(n squared).