Learning residual finite-state automata using observation tables

zbMATH Open1456.68069arXiv1008.1663MaRDI QIDQ4964028FDOQ4964028

Authors: Anna Kasprzik 

Publication date: 24 February 2021

Full work available at URL: https://arxiv.org/abs/1008.1663

Recommendations

• Learning regular languages using RFSAs.
• scientific article; zbMATH DE number 2080668
• Implementation and Application of Automata
• scientific article; zbMATH DE number 1670711
• scientific article; zbMATH DE number 1688359

zbMATH Keywords

grammatical inferenceobservation tablesresidual languages

Mathematics Subject Classification ID

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

Cited In (5)

• Learning residual alternating automata
• Learning probabilistic automata using residuals
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
• Implementation and Application of Automata
• Four one-shot learners for regular tree languages and their polynomial characterizability

This page was built for publication: Learning residual finite-state automata using observation tables

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