Learning and characterizing fully-ordered lattice automata

DOI10.1007/978-3-031-19992-9_17zbMATH Open1522.68267OpenAlexW4313000944MaRDI QIDQ6160917FDOQ6160917

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)