218 search results - page 14 / 44 » Finite Trees as Ordinals |
CIE
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
105
click to vote
SIAMDM
2010
14 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
115
click to vote
IOR
2011
14 years 4 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
CSL
2006
Springer
14 years 10 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...