Width of non-deterministic automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1354120 (Why is no real title available?)
- scientific article; zbMATH DE number 1927559 (Why is no real title available?)
- Alternating finite automata on -words
- Are good-for-games automata good for probabilistic model checking?
- Checking NFA equivalence with bisimulations up to congruence
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Decidability results on the existence of lookahead delegators for NFA
- Deciding parity games in quasipolynomial time
- Forms of determinism for automata
- Nondeterminism in the presence of a diverse or unknown future
- On Determinisation of Good-for-Games Automata
- On the degree of ambiguity of finite automata
- Reasoning about online algorithms with weighted automata
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
Cited in
(7)- Büchi Good-for-Games Automata Are Efficiently Recognizable
- A hierarchy of nondeterminism
- Computer Aided Verification
- On history-deterministic one-counter nets
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
- Computing the width of non-deterministic automata
- VC-dimensions of nondeterministic finite automata for words of equal length
This page was built for publication: Width of non-deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304146)
