234 search results - page 4 / 47 » On Quasi-Products of Tree Automata |
161
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
181
click to vote
FSTTCS
2009
Springer
16 years 16 days ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
245
click to vote
ILC
2007
Springer
16 years 4 days ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
120
click to vote
WIA
2005
Springer
15 years 11 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...