Forms of determinism for automata
From MaRDI portal
Publication:2904745
DOI10.4230/LIPICS.STACS.2012.1zbMATH Open1245.68123OpenAlexW2243686102MaRDI QIDQ2904745FDOQ2904745
Authors: Thomas Colcombet 
Publication date: 23 August 2012
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.1
Recommendations
Cited In (23)
- \(\omega \)-automata
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Determinism and Nondeterminism in Finite Automata with Advice
- On Determinisation of Good-for-Games Automata
- 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
- Title not available (Why is that?)
- Multiplicities: A deterministic view of nondeterminism
- Markov chains and unambiguous automata
- Co-determinism and unambiguity of automata accepting finite or infinite words
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Determinism and fuzzy automata
- Unambiguous languages exhaust the index hierarchy
- The containment problem for unambiguous register automata
- Testing DNA code words properties of regular languages
- The containment problem for unambiguous register automata and unambiguous timed automata
- On history-deterministic one-counter nets
- Computing the width of non-deterministic automata
- 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)
