3378 search results - page 59 / 676 » A universe of binding and computation |
TCS
2008
14 years 9 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
Background: Transcriptional regulation in eukaryotes often involves multiple transcription factors binding to the same transcription control region, and to understand the regulato...
AAAI
2008
15 years 2 days ago
2008
ptimality in Abstract Argumentation Iyad Rahwan 1 Faculty of Informatics, British University in Dubai P.O.Box 502216, Dubai, UAE 2 (Fellow) School of Informatics, University of Edi...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
m Design for Abstract Argumentation Iyad Rahwan 1 (Fellow) School of Informatics, University of Edinburgh, Edinburgh EH8 9LE, UK 2 Faculty of Informatics, British University in Dub...
GCC
2004
Springer
15 years 3 months ago
2004
Springer