Deterministic weighted automata under partial observability

DOI10.1007/978-3-031-43619-2_52MaRDI QIDQ6545582zbMATH OpenFDO

Authors Jakub Michaliszyn, Jan Otop

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_52

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Weighted automata are compact and actively learnable
• Parameterized Weighted Containment
• Parameterized weighted containment
• Learning weighted automata over principal ideal domains
• Probabilistic Weighted Automata

Cites work

• Bidirectional nested weighted automata
• Complexity of equivalence and learning for multiplicity tree automata
• Epistemic ATL with perfect recall, past and strategy contexts
• From model checking to model measuring
• Handbook of modal logic
• Handbook of model checking
• Handbook of weighted automata
• scientific article; zbMATH DE number 5954369 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Learning functions represented as multiplicity automata
• Learning infinite-word automata with loop-index queries
• Learning regular sets from queries and counterexamples
• Quantitative games with interval objectives
• Quantitative languages
• Reachability in two-dimensional vector addition systems with states is PSPACE-complete
• The Complexity of Markov Decision Processes

This page was built for publication: Deterministic weighted automata under partial observability

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