scientific article; zbMATH DE number 7577580

MaRDI QIDQ5101349

Bader abu Radi, Orna Kupferman

Publication date: 30 August 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minimizationcanonizationco-Büchi acceptance conditiondeterminisitc automata on infinite wordsgood-for-games automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

On history-deterministic one-counter nets

Uses Software

• LTL2BA

Cites Work

• Minimizing finite automata is computationally hard
• Efficient minimization of deterministic weak \(\omega\)-automata
• Fair simulation
• Relating word and tree automata
• Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
• Linear Automaton Transformations
• On Determinisation of Good-for-Games Automata
• Hyper-minimizing minimized deterministic finite state automata
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Minimal NFA Problems are Hard
• Limit-Deterministic Büchi Automata for Linear Temporal Logic
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• Minimizing GFG Transition-Based Automata
• Rabin vs. Streett Automata
• How Deterministic are Good-For-Games Automata?
• Nondeterminism in the Presence of a Diverse or Unknown Future
• HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA
• Lattice Automata
• Decision problems forω-automata
• Depth-First Search and Linear Graph Algorithms
• Minimizing Deterministic Lattice Automata
• A Hierarchy of Nondeterminism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: