64 search results - page 5 / 13 » Computability of Countable Subshifts |
ENTCS
2008
13 years 10 months ago
2008
In seeking a unified study of computational effects, in particular in order to give a general operational semantics agreeing with the standard one for state, one must take account...
Book
This is beautifully written book on topology. Author has motivated the subject very nicely with lot of examples. The book covers the following topics: Topology Spaces, The Euclidea...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...