Partially ordered two-way büchi automata

Authors:
Manfred Kufleitner;Alexander Lauser
Affiliations:
FMI, Universität Stuttgart, Germany;FMI, Universität Stuttgart, Germany
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 9
Cited 0

A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Rewriting extended regular expressions

Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
From Mirkin's Prebases to Antimirov's Word Partial Derivatives

Fundamenta Informaticae
On the average number of states of partial derivative automata

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce partially ordered two-way Büchi automata over infinite words. As for finite words, the nondeterministic variant recognizes the fragment Σ2 of first-order logic FO[2-definable ω-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.