Width of Non-deterministic Automata
From MaRDI portal
Publication:3304146
DOI10.4230/LIPIcs.STACS.2018.47zbMath1487.68149OpenAlexW2791897257MaRDI QIDQ3304146
Denis Kuperberg, Anirban Majumdar
Publication date: 5 August 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2018.47
Related Items
Unnamed Item, On history-deterministic one-counter nets, Büchi Good-for-Games Automata Are Efficiently Recognizable
Cites Work
- Alternating finite automata on \(\omega\)-words
- On the degree of ambiguity of finite automata
- Forms of Determinism for Automata (Invited Talk)
- Checking NFA equivalence with bisimulations up to congruence
- Decidability Results on the Existence of Lookahead Delegators for NFA
- On Determinisation of Good-for-Games Automata
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Deciding parity games in quasipolynomial time
- Nondeterminism in the Presence of a Diverse or Unknown Future
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Unnamed Item
- Unnamed Item
- Unnamed Item
