Active Automata Learning with Adaptive Distinguishing Sequences
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Learning Tree Automata with Term Rewriting
Extends Angluin-style tree automata learning with term rewriting systems for deductive inference, reducing query complexity for languages with known properties.
-
Learning Tree Automata with Term Rewriting
Extending tree automaton learning with term rewriting systems enables deductive answers to some queries and reduces query complexity for languages with specified properties.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.