5 papers
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…
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…
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…
Revisiting the Expressiveness Landscape of Data Graph Queries
Michael Benedikt, Anthony Widjaja Lin, Di-De Yen
The study of graph queries in database theory has spanned more than three decades, resulting in a multitude of proposals for graph query languages. We can identify three main famil…