656 search results - page 30 / 132 » Marrying Words and Trees |
FUIN
2010
14 years 9 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
EJC
2007
14 years 11 months ago
2007
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
CSR
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
DAM
2008
14 years 12 months ago
2008
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
ITA
2002
14 years 11 months ago
2002
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are...