35 search results - page 4 / 7 » Equivalence of Deterministic Nested Word to Word Transducers |
107
click to vote
SIAMSC
2010
14 years 8 months ago
2010
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
SIAMSC
2010
14 years 4 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
77
Voted
ACTA
2005
14 years 9 months ago
2005
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
103
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...