Learning realtime one-counter automata

DOI10.1007/978-3-030-99524-9_13MaRDI QIDQ6535566zbMATH OpenFDO

Authors Véronique Bruyère, G. A. Pérez, Gaëtan Staquet

Publication date 23 January 2024

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

active learningreal-time one-counter automata

Mathematics Subject Classification ID

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

Recommendations

• Efficient learning of real time one-counter automata
• Efficient learning of real time two-counter automata
• Learning one-clock timed automata
• Active learning of one-clock timed automata using constraint solving
• A generic algorithm for learning symbolic automata from membership queries

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1916673 (Why is no real title available?)
• Active learning of sequential transducers with side information about the domain
• Adaptive Model Checking
• Bisimulation equivalence and regularity for real-time one-counter automata
• Deterministic one-counter automata
• Efficient learning of real time one-counter automata
• Generating models of infinite-state communication protocols using regular inference with abstraction
• Grey-Box Learning of Register Automata
• Inference of finite automata using homing sequences
• Learning deterministic automata on infinite words
• Learning regular sets from queries and counterexamples
• Negation-closure for JSON schema
• One-counter automata with counter observability
• Programs with lists are counter automata

Cited in

(1)

• Validating streaming JSON documents with learned VPAs

This page was built for publication: Learning realtime one-counter automata

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