1000 search results - page 54 / 200 » Dependency Tree Automata |
FSTTCS
2001
Springer
15 years 4 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
MT
2007
14 years 11 months ago
2007
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
JOBIM
2000
15 years 3 months ago
2000
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
PODS
2007
ACM
15 years 12 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
101
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...