Partially ordered two-way Büchi automata

Thumbnail Image

Date

2010

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

We introduce partially ordered two-way Büchi automata over infinite words. As for finite words, the nondeterministic variant recognizes the fragment Sigma2 of first-order logic FO[<] and the deterministic version yields the Delta2-definable omega-languages. As a byproduct of our results, we show that deterministic partially ordered two-way Büchi automata are effectively closed under Boolean operations. In addition, we have coNP-completeness results for the emptiness problem and the inclusion problem over deterministic partially ordered two-way Büchi automata.

Description

Keywords

Citation

Endorsement

Review

Supplemented By

Referenced By