81 search results - page 2 / 17 » Closure of Language Classes Under Bounded Duplication |
108
click to vote
TIME
2007
IEEE
15 years 5 months ago
2007
IEEE
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
100
click to vote
ECCC
2000
14 years 11 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
IPL
2006
14 years 11 months ago
2006
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
89
Voted
LATA
2009
Springer
15 years 6 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...