Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
In this paper we compare the semantical and syntactical definitions of extensions for open default theories. We prove that, over monadic languages, these definitions are equivalent and do not depend on the cardinality of the underlying infinite world. We also show that, under the domain closure assumption, one free variable open default theories are decidable. © 2006 Elsevier B.V. All rights reserved.
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006