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...
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...
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...
: 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...
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 ...