Learning deterministic visibly pushdown automata under accessible stack

DOI10.4230/LIPICS.MFCS.2022.74MaRDI QIDQ6584078zbMATH OpenFDO

Authors Jakub Michaliszyn, Jan Otop

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.74

zbMATH Keywords

automata inferenceminimizationvisibly pushdown automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Automatic assume-guarantee reasoning for safety and liveness using passive learning

This page was built for publication: Learning deterministic visibly pushdown automata under accessible stack

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