Sciweavers

219 search results - page 1 / 44
» Bond-Free Languages: Formalizations, Maximality and Construc...
Sort
View
DNA
2004
Springer
157views Bioinformatics» more  DNA 2004»
13 years 10 months ago
Bond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
Lila Kari, Stavros Konstantinidis, Petr Sosí...
TYPES
2000
Springer
13 years 8 months ago
Formalizing the Halting Problem in a Constructive Type Theory
We present a formalization of the halting problem in Agda, a language based on Martin-L
Kristofer Johannisson
ICFCA
2004
Springer
13 years 10 months ago
AddIntent: A New Incremental Algorithm for Constructing Concept Lattices
Dean van der Merwe, Sergei A. Obiedkov, Derrick G....
FUIN
2010
89views more  FUIN 2010»
13 years 3 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
IJCSA
2008
126views more  IJCSA 2008»
13 years 5 months ago
The GOQL Language and its Formal Specifications
The Graphical Object Query Language (GOQL) is a graphical query language that complies with the ODMG standard and runs on top of the o2 DBMS. The language provides users with the ...
Euclid Keramopoulos, Philippos Pouyioutas, Tasos P...