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...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Logical Methods in Computer Science e.V.
2008-06-01
|
| Serie: | Logical Methods in Computer Science |
| Soggetti: | |
| Accesso online: | https://lmcs.episciences.org/827/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|