10 search results - page 2 / 2 » Canonical derivatives, partial derivatives and finite automa... |
DLT
2008
13 years 6 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
DM
2008
13 years 5 months ago
2008
We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our ...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
SIAMCO
2010
13 years 21 hour ago
2010
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
EACL
2006
ACL Anthology
13 years 6 months ago
2006
ACL Anthology
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...