Sciweavers

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í...
ICALP
2007
Springer
13 years 11 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
CIE
2007
Springer
13 years 11 months ago
Circuit Complexity of Regular Languages
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
Michal Koucký
VL
2007
IEEE
157views Visual Languages» more  VL 2007»
13 years 11 months ago
Spider Diagrams of Order
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
Aidan Delaney, Gem Stapleton