47 search results - page 5 / 10 » On the Recognizability of Self-generating Sets |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This article presents the results of experiments performed with agents based on an operalization of an information-theoretic model for trust. Experiments have been performed with t...
MST
2011
13 years 2 months ago
2011
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
FGR
2011
IEEE
12 years 11 months ago
2011
IEEE
— Common human actions are instantly recognizable by people and increasingly machines need to understand this language if they are to engage smoothly with people. Here we introdu...