35 search results - page 2 / 7 » mfcs 2009 |
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
MFCS
2009
Springer
13 years 11 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...
MFCS
2009
Springer
13 years 11 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 ...