108 search results - page 14 / 22 » iandc 2006 |
94
Voted
IANDC
2007
14 years 9 months ago
2007
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
IANDC
2007
14 years 9 months ago
2007
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
IANDC
2002
14 years 9 months ago
2002
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
IANDC
1998
14 years 9 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
IANDC
2010
14 years 8 months ago
2010
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast netwo...