Logic and Branching Automata
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 se...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Logical Methods in Computer Science e.V.
2015-10-01
|
| Col·lecció: | Logical Methods in Computer Science |
| Matèries: | |
| Accés en línia: | https://lmcs.episciences.org/1603/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|