Logic and Branching Automata
Formal Languages and Automata Theory
2017-01-11 v2 Logic in Computer Science
Abstract
In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we define a logic, named P-MSO as it is a extension of monadic second-order logic with Presburger arithmetic, and show that it is precisely as expressive as branching automata. As a consequence of the effectiveness of the construction of one formalism from the other, the P-MSO theory of the class of all finite N-free posets is decidable.
Cite
@article{arxiv.1507.02890,
title = {Logic and Branching Automata},
author = {Bedon Nicolas},
journal= {arXiv preprint arXiv:1507.02890},
year = {2017}
}