97
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
55
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
90
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
106
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
59
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
95
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
108
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
78
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We define a framework called the prismoid of resources where each vertex refines the λ-calculus by using a different choice to make explicit or implicit (meta-level) the defin...
98
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
81
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Let I be a finite set of integers and F be a finite set of maps of the form n → ki n + i with integer coefficients. For an integer base k ≥ 2, we study the k-recognizability ...