Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
Exact Separation of Words via Trace Geometry
Zeyu Chen, Junde Wu
A basic question in the study of measure-once quantum finite automata is whether two distinct input words can be separated with certainty. The exact separation problem reduces to a…
cs.FL2026
Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
Zeyu Chen, Junde Wu
Affine automata provide a finite-state computational model that preserves the linear-algebraic structure of quantum computation while operating entirely over the reals. Recent work…
cs.FL2026
The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
Zeyu Chen, Junde Wu
Generalized finite automata (GFAs), probabilistic finite automata (PFAs), and one-way general quantum finite automata (1gQFA) recognize the same strict-cutpoint languages, but the…