Sciweavers

14 search results - page 3 / 3
» Tree-walking automata do not recognize all regular languages
Sort
View
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 10 months ago
XML transformation by tree-walking transducers with invisible pebbles
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�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
ICFP
2006
ACM
14 years 9 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
ICDAR
2009
IEEE
14 years 4 months ago
Robust Recognition of Documents by Fusing Results of Word Clusters
The word error rate of any optical character recognition system (OCR) is usually substantially below its component or character error rate. This is especially true of Indic langua...
Venkat Rasagna, Anand Kumar 0002, C. V. Jawahar, R...
MST
2010
101views more  MST 2010»
13 years 8 months ago
Automatic Presentations and Semigroup Constructions
atic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations ca...
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Ric...