Sciweavers

12 search results - page 2 / 3
» wia 2005
Sort
View
WIA
2005
Springer
15 years 3 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
WIA
2005
Springer
15 years 3 months ago
Learning Stochastic Finite Automata for Musical Style Recognition
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We use them to model musical styles: a same automaton can be used to...
Colin de la Higuera, Frédéric Piat, ...
WIA
2005
Springer
15 years 3 months ago
Robust Spelling Correction
The paper introduces a robust spelling correction technique to deal with ill-formed input strings, including unknown parts of unknown length. In contrast to previous works, we deri...
Manuel Vilares Ferro, Juan Otero Pombo, Jesú...
WIA
2005
Springer
15 years 3 months ago
A Class of Rational n-WFSM Auto-intersections
Weighted finite-state machines with n tapes describe n-ary rational string relations. The join n-ary relation is very important regarding to applications. It is shown how to compu...
André Kempe, Jean-Marc Champarnaud, Jason E...
WIA
2005
Springer
15 years 3 months ago
Compressing XML Documents Using Recursive Finite State Automata
Abstract. We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive a...
Hariharan Subramanian, Priti Shankar