10493 search results - page 8 / 2099 » Dynamic Word Problems |
FCT
2009
Springer
14 years 2 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
JCC
2007
13 years 7 months ago
2007
Abstract: The physical interactions among electrons and nuclei, responsible for the chemistry of atoms and molecules, is well described by quantum mechanics and chemistry is theref...
ITA
2008
13 years 7 months ago
2008
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
EVOW
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
ENTCS
2007
13 years 7 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...