WIA
2005
Springer
13 years 10 months ago
2005
Springer
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...
WIA
2005
Springer
13 years 10 months ago
2005
Springer
WIA
2005
Springer
13 years 10 months ago
2005
Springer
WIA
2005
Springer
13 years 10 months ago
2005
Springer
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...
WIA
2005
Springer
13 years 10 months ago
2005
Springer
WIA
2005
Springer
13 years 10 months ago
2005
Springer
WIA
2005
Springer
13 years 10 months ago
2005
Springer
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...
WIA
2005
Springer
13 years 10 months ago
2005
Springer
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...
WIA
2005
Springer
13 years 10 months ago
2005
Springer
WIA
2005
Springer
13 years 10 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...