303 search results - page 12 / 61 » Automata on Gauss Words |
JAC
2008
13 years 11 months ago
2008
In this paper, two-dimensional cellular automata as one-dimensional language recognizers are considered. Following the approach of M. Delorme and J. Mazoyer to embed one-dimensiona...
INFORMATICALT
2000
13 years 9 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
GROUP
1997
ACM
14 years 1 months ago
1997
ACM
Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team autom...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...