Pages that link to "Item:Q1603452"
From MaRDI portal
The following pages link to Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452):
Displaying 33 items.
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Classifying recognizable infinitary trace languages using word automata (Q2407086) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete (Q2908870) (← links)
- Quasi-weak cost automata: a new variant of weakness (Q2911613) (← links)
- Classifying Recognizable Infinitary Trace Languages Using Word Automata (Q2922012) (← links)
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order (Q2988842) (← links)
- COMPUTING CONVEX HULLS BY AUTOMATA ITERATION (Q3395136) (← links)
- Memory Reduction for Strategies in Infinite Games (Q3503911) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
- Weak Minimization of DFA — An Algorithm and Applications (Q3559776) (← links)
- Short Witnesses and Accepting Lassos in ω-Automata (Q3564867) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata (Q4913771) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- Optimizing Winning Strategies in Regular Infinite Games (Q5448640) (← links)
- (Q5875345) (← links)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)
- Dissecting \texttt{ltlsynt} (Q6151759) (← links)
- Minimization of automata for liveness languages (Q6160912) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q6535954) (← links)
- Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)