5 citations · 10 across the 3 of their papers we have counts for
1 paper · 1 filter
Daowen Qiu, Lvzhou Li, Paulo Mateus +1
We show that there are quantum devices that accept all regular languages and that are exponentially more concise than deterministic finite automata (DFA). For this purpose, we intr…