2435 search results - page 351 / 487 » Intellexer Question Answering |
JAPLL
2008
15 years 24 days ago
2008
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
114
click to vote
CORR
2007
Springer
15 years 24 days ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
108
Voted
DM
2007
15 years 23 days ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
103
Voted
JGT
2006
15 years 23 days ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
67
Voted
JSYML
2006
15 years 23 days ago
2006
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...