773 search results - page 55 / 155 » Suffix Trees on Words |
169
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
169
click to vote
FUIN
2010
15 years 3 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 ...
147
click to vote
EJC
2007
15 years 6 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...
158
click to vote
CSR
2009
Springer
15 years 10 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...
155
click to vote
DAM
2008
15 years 6 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...