555 search results - page 6 / 111 » Complexity of Operations on Cofinite Languages |
OTM
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
JACM
2002
13 years 7 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
ICEBE
2005
IEEE
14 years 1 months ago
2005
IEEE
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
CSL
1999
Springer
13 years 11 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...