161 search results - page 18 / 33 » Counting Distinct Strings |
SYNTHESE
2010
13 years 7 months ago
2010
I develop a strategy for representing epistemic states and epistemic changes that seeks to be sensitive to the difference between voluntary and involuntary aspects of our epistemi...
COCOON
2006
Springer
14 years 9 days ago
2006
Springer
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
EACL
1993
ACL Anthology
13 years 10 months ago
1993
ACL Anthology
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
PRL
2000
13 years 8 months ago
2000
: In this study, we introduce a set of one-dimensional features to represent two dimensional shape information for HMM (Hidden Markov Model) based handwritten optical character rec...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...