works on
complexity analysis 1explorable automata 1history-deterministic automata 1infinite-word acceptance 1parity automata 1

From the 1 of 4 papers with an AI index.

most citedNoise-induced shallow circuits and absence of barren plateaus

10 citations

researchers with a paper here
collaborating institutions
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2026

Explorable Parity Automata

Emile Hazard, Olivier Idir, Denis Kuperberg

The paper introduces explorable automata, a generalization of history‑deterministic automata that resolves nondeterminism using multiple simultaneous runs, and studies their decisi…