205 search results - page 27 / 41 » Testing the Equivalence of Regular Languages |
110
click to vote
PODS
2007
ACM
16 years 2 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�...
111
click to vote
POPL
2010
ACM
15 years 11 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...
125
click to vote
TREC
2000
15 years 3 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
15 years 3 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...
124
click to vote
WWW
2005
ACM
16 years 2 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...