1 citations · 2 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
Resolving Nondeterminism by Chance
Soumyajit Paul, David Purser, Sven Schewe +3
History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next…
A Finite Exact Representation of Register Automata Configurations
Yu-Fang Chen, Bow-Yaw Wang, Di-De Yen
A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many…