1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
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
Complementing Emerson-Lei Elevator Automata (Technical Report)
Ondrej Alexaj, Vojtěch Havlena, Ondřej Lengál +2
Büchi elevator automata naturally appear in several areas of formal methods as a structural expressibly-equivalent subclass of Büchi automata where every strongly connected compone…
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…