1 citations · 2 across the 7 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.FL2026
The Emptiness Problem for Quantum Finite Automata with Classical States
Jyun-Ao Lin, Patrick Totzke, Yun Chen Tsai +1
Quantum Finite Automata with Classical states (QFACs) are nondeterministic finite automata over a finite alphabet of quantum operations. We study expressiveness of this model on fi…
cs.CL2026
Learning Canonical Register Automata over Ordered Data Domains
Yong Li, Qiyi Tang, Di-De Yen
Register automata are finite automata equipped with memory that recognize data languages over infinite alphabets. In this work, we investigate active learning algorithms for determ…
cs.FL2026
Hyper-Minimization for Deterministic Register Automata
Yong Li, Qiyi Tang, Di-De Yen
We investigate hyper-minimization for deterministic register automata (DRAs). We begin by introducing DRA counterparts of classical notions from deterministic finite automata. Buil…