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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Logical Methods in Computer Science e.V.
2015-10-01
|
| Edice: | Logical Methods in Computer Science |
| Témata: | |
| On-line přístup: | https://lmcs.episciences.org/1603/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|