1,314 research outputs found
Open Problems in Parameterized and Exact Computation - IWPEC 2006
In September 2006, the Second International Workshop on Parameterized and
Exact Computation was held in Zürich, Switzerland, as part of ALGO 2006. At the
end of IWPEC 2006, a problem session was held. (Most of) the problems mentioned
at this problem session, and some other problems, contributed by the participants of
IWPEC 2006 are listed here
Interim research assessment 2003-2005 - Computer Science
This report primarily serves as a source of information for the 2007 Interim Research Assessment Committee for Computer Science at the three technical universities in the Netherlands. The report also provides information for others interested in our research activities
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time
We present two structural results concerning the longest common prefixes of non-empty languages.
First, we show that the longest common prefix of the language generated by a context-free grammar of size N
equals the longest common prefix of the same grammar where the heights of the derivation trees are bounded by
4N.
Second, we show that each non-empty language L has a representative subset of at most three elements which behaves
like L w.r.t. the longest common prefix as well as w.r.t. longest common prefixes of L after unions or
concatenations with arbitrary other languages.
From that, we conclude
that the longest common prefix, and thus the longest common suffix, of a context-free language can be computed in polynomial time
- …