205 search results - page 27 / 41 » Testing the Equivalence of Regular Languages |
PODS
2007
ACM
15 years 9 months ago
2007
ACM
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�...
POPL
2010
ACM
15 years 6 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
TREC
2000
14 years 10 months ago
2000
We investigated the dictionary-based query translation method combining the translation disambiguation process using statistic cooccurrence information trained from the provided c...
ACL
2008
14 years 11 months ago
2008
Traditional wisdom holds that once documents are turned into bag-of-words (unigram count) vectors, word orders are completely lost. We introduce an approach that, perhaps surprisi...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...