373 search results - page 9 / 75 » Counting in Trees for Free |
120
click to vote
CAAP
1994
15 years 1 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
IANDC
2008
14 years 10 months ago
2008
Abstract. Unfortunately the class of transformations computed by nondeleting and linear extended top-down tree transducers [Graehl, Knight: Training Tree Transducers. HLT-NAACL 200...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Wikipedia, "the free encyclopedia", now contains over two million English articles, and is widely regarded as a highquality, authoritative encyclopedia. Some Wikipedia a...
LICS
1995
IEEE
15 years 1 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
158
click to vote
POPL
2004
ACM
15 years 10 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...