254 search results - page 35 / 51 » Restarting Tree Automata |
CSR
2010
Springer
14 years 4 days ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
XIMEP
2004
ACM
14 years 2 months ago
2004
ACM
We argue that efficient support for schema validation and type annotation in XQuery processors deserves as much attention as efficient evaluation techniques for XPath queries have...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
FSTTCS
2001
Springer
14 years 1 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
13 years 8 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...