35 search results - page 3 / 7 » mfcs 2007 |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with th...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...