On complementing unambiguous automata and graphs with many cliques and cocliques
We show that for any unambiguous finite automaton with n states there exists an unambiguous finite automaton with √n + 1 · 2n/2 states that recognizes the complement language. This builds and improves upon a similar result by Jirásek et al. (2018) [1]. Our improvement is based on a reduction to and...
Príomhchruthaitheoirí: | Indzhev, E, Kiefer, S |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
Elsevier
2022
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Markov chains and unambiguous automata
de réir: Baier, C, et al.
Foilsithe / Cruthaithe: (2023) -
Markov chains and unambiguous Büchi automata
de réir: Baier, C, et al.
Foilsithe / Cruthaithe: (2016) -
Markov Chains and Unambiguous Büchi Automata
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2016) -
Lower bounds for unambiguous automata via communication complexity
de réir: Göös, M, et al.
Foilsithe / Cruthaithe: (2022) -
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2019)