Efficient minimization of deterministic weak \(\omega\)-automata
From MaRDI portal
Publication:1603452
DOI10.1016/S0020-0190(00)00183-6zbMath1032.68103OpenAlexW2116820075WikidataQ62638372 ScholiaQ62638372MaRDI QIDQ1603452
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00183-6
Related Items (25)
From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Classifying Recognizable Infinitary Trace Languages Using Word Automata ⋮ Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic ⋮ Classifying recognizable infinitary trace languages using word automata ⋮ Memory Reduction for Strategies in Infinite Games ⋮ On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words ⋮ Dissecting \texttt{ltlsynt} ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ Minimization of automata for liveness languages ⋮ Unnamed Item ⋮ First-Order Logic and Numeration Systems ⋮ Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order ⋮ Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) ⋮ Certifying inexpressibility ⋮ A Generalization of Semenov’s Theorem to Automata over Real Numbers ⋮ Optimizing Winning Strategies in Regular Infinite Games ⋮ Unnamed Item ⋮ A generalization of Cobham's theorem to automata over real numbers ⋮ Minimizing GFG Transition-Based Automata ⋮ COMPUTING CONVEX HULLS BY AUTOMATA ITERATION ⋮ Don't care words with an application to the automata-based approach for real addition ⋮ \( \omega \)-automata ⋮ Relating word and tree automata ⋮ An analogue of Cobham's theorem for graph directed iterated function systems ⋮ Uniform strategies, rational relations and jumping automata
Cites Work
This page was built for publication: Efficient minimization of deterministic weak \(\omega\)-automata
