Query learning algorithm for residual symbolic finite automata

MaRDI QIDQ5020531zbMATH OpenFDO

Authors Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/1902.07417, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2019.10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The learnability of symbolic automata
• Inferring Symbolic Automata
• Learning residual finite-state automata using observation tables
• Learning residual alternating automata
• scientific article; zbMATH DE number 1670711

Cites work

• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• A generic algorithm for learning symbolic automata from membership queries
• An efficient query learning algorithm for ordered binary decision diagrams
• Inference of finite automata using homing sequences
• Learning Meets Verification
• Learning register automata: from languages to program structures
• Learning regular languages over large ordered alphabets
• Learning regular languages using RFSAs.
• Learning regular sets from queries and counterexamples
• Learning symbolic automata

Cited in

(4)

• Inferring symbolic automata
• Learning infinite-word automata with loop-index queries
• Inferring Symbolic Automata
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Describes a project that uses

Uses Software

• Rex

This page was built for publication: Query learning algorithm for residual symbolic finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020531)