Visibly Tree Automata with Memory and Constraints
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure...
Wedi'i Gadw mewn:
| Prif Awduron: | , , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Logical Methods in Computer Science e.V.
2008-06-01
|
| Cyfres: | Logical Methods in Computer Science |
| Pynciau: | |
| Mynediad Ar-lein: | https://lmcs.episciences.org/827/pdf |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|