35 search results - page 6 / 7 » mfcs 2007 |
117
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
120
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
108
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
161
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
125
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...