Learning and characterizing fully-ordered lattice automata

DOI10.1007/978-3-031-19992-9_17MaRDI QIDQ6160917zbMATH OpenOpenAlexFDO

Authors Dana Fisman, Sagi Saadon

Publication date 2 June 2023

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-19992-9_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Approximating deterministic lattice automata
• Lattice Minimal Automata and Lattice Reduced Automata
• Minimizing deterministic lattice automata
• Minimizing deterministic lattice automata
• The learnability of symbolic automata

Cites work

• scientific article; zbMATH DE number 1670794 (Why is no real title available?)
• scientific article; zbMATH DE number 7650821 (Why is no real title available?)
• A tableau construction for finite linear-time temporal logic
• Efficient parametric identification for STL
• Inference of finite automata using homing sequences
• Lattice Automata
• Learning I/O automata
• Learning automata with side-effects
• Learning context-free grammars from structural data in polynomial time
• Learning functions represented as multiplicity automata
• Learning of Structurally Unambiguous Probabilistic Grammars
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• Learning symbolic automata
• Learning weighted automata
• Linear Automaton Transformations
• Minimization, Learning, and Conformance Testing of Boolean Programs
• Minimizing deterministic lattice automata
• On model checking multiple hybrid views

This page was built for publication: Learning and characterizing fully-ordered lattice automata

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