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...
主要な著者: | Indzhev, E, Kiefer, S |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Elsevier
2022
|
類似資料
-
Markov chains and unambiguous automata
著者:: Baier, C, 等
出版事項: (2023) -
Markov chains and unambiguous Büchi automata
著者:: Baier, C, 等
出版事項: (2016) -
Markov Chains and Unambiguous Büchi Automata
著者:: Kiefer, S, 等
出版事項: (2016) -
Lower bounds for unambiguous automata via communication complexity
著者:: Göös, M, 等
出版事項: (2022) -
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
著者:: Kiefer, S, 等
出版事項: (2019)