Forms of determinism for automata
From MaRDI portal
Recommendations
Cited in
(27)- Multiplicities: A deterministic view of nondeterminism
- Determinism and fuzzy automata
- The containment problem for unambiguous register automata and unambiguous timed automata
- -automata
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Unambiguous Büchi Is Weak
- Co-determinism and unambiguity of automata accepting finite or infinite words
- Width of non-deterministic automata
- On Determinisation of Good-for-Games Automata
- On the strength of unambiguous tree automata
- Unambiguous languages exhaust the index hierarchy
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- The containment problem for unambiguous register automata
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Computing the width of non-deterministic automata
- (k,l)-unambiguity and quasi-deterministic structures: an alternative for the determinization
- Unambiguity in automata theory
- Good for games automata: from nondeterminism to alternation
- On history-deterministic one-counter nets
- Markov chains and unambiguous automata
- Determinism and Nondeterminism in Finite Automata with Advice
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Positionality in ^0_2 and a completeness result
- Deciding what is good-for-MDPs
- Bidimensional linear recursive sequences and universality of unambiguous register automata
- Positionality in _0² and a completeness result
- Testing DNA code words properties of regular languages
This page was built for publication: Forms of determinism for automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904745)
