Learning residual alternating automata

DOI10.1016/j.ic.2022.104981OpenAlexW2613316388MaRDI QIDQ2105462

Matthias Lutter, Sebastian Berndt, Maciej Liśkiewicz, K. Ruediger Reischuk

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104981

zbMATH Keywords

alternating finite automatalearning regular languagesminimal adequate teacherresidual automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• libalf
• LearnLib

Cites Work

• Learning regular sets from queries and counterexamples
• Approximation algorithms for combinatorial problems
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Learning regular languages using RFSAs.
• Inferring regular languages and \(\omega\)-languages
• The Design of Approximation Algorithms
• Linear Automaton Transformations
• Alternation
• Minimal NFA Problems are Hard
• Synthesis of interface specifications for Java classes
• CONCUR 2004 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning residual alternating automata