Forms of Determinism for Automata (Invited Talk)
From MaRDI portal
Publication:2904745
DOI10.4230/LIPIcs.STACS.2012.1zbMath1245.68123OpenAlexW2243686102MaRDI QIDQ2904745
Publication date: 23 August 2012
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.1
Related Items (17)
On Determinisation of Good-for-Games Automata ⋮ Unnamed Item ⋮ Width of Non-deterministic Automata ⋮ On history-deterministic one-counter nets ⋮ Markov chains and unambiguous automata ⋮ Testing DNA code words properties of regular languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ On the Strength of Unambiguous Tree Automata ⋮ The containment problem for unambiguous register automata and unambiguous timed automata ⋮ Unambiguous Büchi Is Weak ⋮ The Containment Problem for Unambiguous Register Automata ⋮ Büchi Good-for-Games Automata Are Efficiently Recognizable ⋮ \( \omega \)-automata ⋮ Unambiguity in Automata Theory ⋮ 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 (Invited Talk)
