Polynomial Identification of-Automata
We study identification in the limit using polynomial time and data for models of ω-automata.
On the negative side we show that non-deterministic ω-automata (of types Büchi, coBüchi …
On the negative side we show that non-deterministic ω-automata (of types Büchi, coBüchi …
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
A characteristic sample for a language L and a learning algorithm L is a finite sample of
words TL labeled by their membership in L such that for any sample T⊇ TL consistent with …
words TL labeled by their membership in L such that for any sample T⊇ TL consistent with …
ALMA: Automata Learner using Modulo 2 Multiplicity Automata
N George - arXiv preprint arXiv:2301.04077, 2023 - arxiv.org
We present ALMA (Automata Learner using modulo 2 Multiplicity Automata), a Java-based
tool that can learn any automaton accepting regular languages of finite or infinite words with …
tool that can learn any automaton accepting regular languages of finite or infinite words with …
3.4 A primer on reactive synthesis
B Finkbeiner - The Futures of Reactive Synthesis - drops.dagstuhl.de
The synthesis of reactive systems has been actively investigated since the inception of the
problem by Alonzo Church more than sixty years ago. This talk gives an overview of the …
problem by Alonzo Church more than sixty years ago. This talk gives an overview of the …