On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words

DOI10.3233/fi-222152arXiv2211.08787OpenAlexW4383956509MaRDI QIDQ6094518

Unnamed Author, Christof Löding

Publication date: 14 September 2023

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.08787

zbMATH Keywords

learningminimizationdeterministic \(\omega\)-automatadon't care words

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• On syntactic congruences for \(\omega\)-languages
• Efficient minimization of deterministic weak \(\omega\)-automata
• Automata, logics, and infinite games. A guide to current research
• On the learnability of infinitary regular sets
• Computer aided verification. 18th international conference, CAV 2006, Seattle, WA, USA, August 17--20, 2006. Proceedings.
• Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
• New Optimizations and Heuristics for Determinization of Büchi Automata
• On ω-regular sets
• State Reduction in Incompletely Specified Finite-State Machines
• Computing the Rabin Index of a Parity Automaton
• Reducibility among Combinatorial Problems
• Polynomial Identification of $$\omega $$-Automata

This page was built for publication: On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words