18 search results - page 2 / 4 » Conway Games, Coalgebraically |
ENTCS
2008
13 years 5 months ago
2008
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
IANDC
2006
13 years 5 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In his celebrated book On Numbers and Games (Academic Press, New-York, 1976), J. H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the N...