43 search results - page 6 / 9 » Minimizing Tree Automata for Unranked Trees |
MST
2010
13 years 5 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
PODS
2010
ACM
14 years 13 days ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
JAPLL
2010
13 years 5 months ago
2010
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...