Complementation of Finitely Ambiguous Buchi Automata

被引：6
|
作者：
Rabinovich, Alexander [1 ]
机构：
[1] Tel Aviv Univ, Tel Aviv, Israel
来源：
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018 | 2018年 / 11088卷
关键词：
COMPLEXITY; LANGUAGES;
D O I：
10.1007/978-3-319-98654-8_44
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A nondeterministic automaton is finitely ambiguous if for each input there is at most finitely many accepting runs. We prove that the complement of the omega-language accepted by a finitely ambiguous Buchi automaton with n states is accepted by an unambiguous Buchi automaton with 2 x 5(n) states.
引用
收藏
页码：541 / 552
页数：12
相关论文
共 50 条
12345