Active Automata Learning with Adaptive Distinguishing Sequences
This document investigates the integration of adaptive distinguishing sequences into the process of active automata learning (AAL). A novel AAL algorithm "ADT" (adaptive discrimination tree) is developed and presented. Since the submission of the original thesis, the presented algorithm has been integrated into LearnLib - an open-source library for active automata learning - and has been successfully used in related fields of research.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Quantitative Automata Modulo Theories
Quantitative automata are useful representations for numerous applications, including modeling probability distributions over sequences to Markov chains and reward machines. Actively learning such automata typically occu…
Active LearningvalidAutomata Learning from Preference and Equivalence Queries
Active automata learning from membership and equivalence queries is a foundational problem with numerous applications. We propose a novel variant of the active automata learning problem: actively learn finite automata us…
NavigateState Matching and Multiple References in Adaptive Active Automata Learning
Active automata learning (AAL) is a method to infer state machines by interacting with black-box systems. Adaptive AAL aims to reduce the sample complexity of AAL by incorporating domain specific knowledge in the form of…
Extracting Robust Register Automata from Neural Networks over Data Sequences
Automata extraction is a method for synthesising interpretable surrogates for black-box neural models that can be analysed symbolically. Existing techniques assume a finite input alphabet, and thus are not directly appli…
On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach
Semiautomata form a rich class of sequence-processing algorithms with applications in natural language processing, robotics, computational biology, and data mining. We establish the first Statistical Query hardness resul…