64 search results - page 2 / 13 » Computability of Countable Subshifts |
TCS
2010
12 years 12 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
STACS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...
CIE
2006
Springer
13 years 7 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
COLING
2002
13 years 5 months ago
2002
In this paper we show to what degree the countability of English nouns is predictable from their semantics. We found that at 78% of nouns' countability could be predicted usi...
APAL
2006
13 years 5 months ago
2006
The Dushnik