Titlebook: Language and Automata Theory and Applications; 6th International Co Adrian-Horia Dediu,Carlos Martín-Vide Conference proceedings 2012 Sprin

線

Measuring Information in Timed Languagespplications to computer-aided verification. However the theory of timed regular languages is far from being achieved. Seven years ago, in [2], I argued that developing such a theory constituted an important research challenge, and I sketched a research program in this direction. Unfortunately, when

bile648

The Computer Science of DNA Nanotechnologying at atomic and molecular scales. This field is now a rapidly growing interdisciplinary research adventure involving chemists, molecular biologists, computer scientists, materials scientists, electrical and computer engineers, and others. DNA tile assembly, DNA origami, and DNA strand displacement

reflection

江湖郎中

BOLT

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits .(..,..,…,..) and .(..,..,…,..) differ on at most an . fraction of all Boolean inputs {0,1}.. We give a randomized . algorithm that computes a .-approximate isomorphism between two isomorphic Boolean functions . and . that are given by depth . circuits of poly(.) size, where . is a constant indepen

Initial

Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Spacemplexity classes, respectively. Recently, Morita introduced . multi-head finite automata (RMFAs), and posed the question of whether RMFAs characterize reversible logarithmic space as well. Here, we resolve the question affirmatively, by exhibiting a clean RMFA simulation of logarithmic space reversi

軍械庫

不能強迫我

Longest Common Extensions via Fingerprinting ..(.,.), is the length of the longest common prefix of the pair of suffixes starting at index . and . in the string .. The LCE problem can be solved in linear space with constant query time and a preprocessing of sorting complexity. There are two known approaches achieving these bounds, which use n

繁重

Fast and Cache-Oblivious Dynamic Programming with Local Dependencieskey task (and often computational bottleneck) in large-scale textual information retrieval. For instance, algorithms for sequence alignment are widely used in bioinformatics to compare DNA and protein sequences. These problems can all be solved using essentially the same dynamic programming scheme o

擁護者

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchingsem and algorithms for maximal matchings have been used as submodules for problems like maximal node-disjoint paths or maximum flow. Since in some applications graphs become larger and larger, a research branch has emerged which is concerned with the design and analysis of implicit algorithms for cla