12 search results - page 3 / 3 » On Nondeterministic Unranked Tree Automata with Sibling Cons... |
AUSAI
2003
Springer
13 years 11 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...