Forms of determinism for automata
From MaRDI portal
Publication:2904745
Recommendations
Cited in
(23)- -automata
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- On Determinisation of Good-for-Games Automata
- Determinism and Nondeterminism in Finite Automata with Advice
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Unambiguous Büchi Is Weak
- (k,l)-unambiguity and quasi-deterministic structures: an alternative for the determinization
- scientific article; zbMATH DE number 7649927 (Why is no real title available?)
- Multiplicities: A deterministic view of nondeterminism
- Co-determinism and unambiguity of automata accepting finite or infinite words
- Markov chains and unambiguous automata
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Determinism and fuzzy automata
- Testing DNA code words properties of regular languages
- Unambiguous languages exhaust the index hierarchy
- The containment problem for unambiguous register automata
- The containment problem for unambiguous register automata and unambiguous timed automata
- On history-deterministic one-counter nets
- Width of non-deterministic automata
- Computing the width of non-deterministic automata
- Unambiguity in automata theory
- On the strength of unambiguous tree automata
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
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)
