Sciweavers

ACL
1998
14 years 25 days ago
Transforming Lattices into Non-deterministic Automata with Optional Null Arcs
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
Mark Seligman, Christian Boitet, Boubaker Meddeb-H...
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 11 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun