1237 search results - page 14 / 248 » Abstract shade trees |
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that...
JUCS
2002
14 years 9 months ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
ZMADIA Zsolt, Mr. Simplex methods and the convex quadratic programming problem 1026Abstract00059.doc EYAT Mujahed, Mr. IPM based sparse LP solver o...
114
click to vote
IANDC
2011
14 years 4 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...