Learning Symbolic Automata

DOI10.1007/978-3-662-54577-5_10zbMath1452.68092OpenAlexW2600860451MaRDI QIDQ3303893

Samuel Drews, Loris D'Antoni

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54577-5_10

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (14)

Learning One-Clock Timed Automata ⋮ Improving Symbolic Automata Learning with Concolic Execution ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Active automata learning as black-box search and lazy partition refinement ⋮ Inferring Symbolic Automata ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Learning and characterizing fully-ordered lattice automata ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ Fast computations on ordered nominal sets ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Inferring switched nonlinear dynamical systems

Uses Software

• Sigma*

Cites Work

• Active learning for extended finite state machines
• Learning regular sets from queries and counterexamples
• Sigma*
• Learning Regular Languages over Large Ordered Alphabets
• Learning Regular Languages Using Nondeterministic Finite Automata
• Synthesis of interface specifications for Java classes
• Learning nominal automata
• Minimization of symbolic automata

This page was built for publication: Learning Symbolic Automata