In 1987 Angluin proposed an algorithm, termed L⁎ for inferring an unknown regular
language using membership and equivalence queries. This algorithm has found many …

Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …

Abstract Automata learning has been successfully applied in the verification of hardware
and software. The size of the automaton model learned is a bottleneck for scalability, and …

We propose a new framework for active learning of deterministic infinite-words automata. In
our framework, the teacher answers standard membership and equivalence queries, and …

The classical powerset construction is a standard method converting a non-deterministic
automaton into a deterministic one recognising the same language. Recently, the powerset …

We study active learning of deterministic infinite-words automata. In our framework, the
teacher answers not only membership and equivalence queries, but also provides the loop …

We are motivated by the following question: which nominal languages admit an active
learning algorithm? This question was left open in previous work, and is particularly …

正则语言推断研究从语言的有限信息出发, 通过归纳和推理得出正则语言模型.
该技术在信息抽取, 软件工程, 模式识别等领域应用广泛. 本文首先阐明了语言的可学习性概念和 …

Many methods for the verification of complex computer systems require the existence of a
tractable mathematical abstraction of the system, often in the form of an automaton. In reality …

Learning finite automata (termed as model learning) has become an important field in
machine learning and has been useful realistic applications. Quantum finite automata (QFA) …