Tree Automata With One Memory, Set Constraints and Cryptographic Protocols
by
Hubert Comon
| Citations: | 65 - 4 self |
BibTeX
@MISC{Comon_treeautomata,
author = {Hubert Comon},
title = {Tree Automata With One Memory, Set Constraints and Cryptographic Protocols},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a class of tree automata that perform tests on a memory that is updated using function symbol application and projection. The language emptiness problem for this class of tree automata is shown to be in DEXPTIME.
