303 search results - page 12 / 61 » Automata on Gauss Words |
107
Voted
JAC
2008
15 years 1 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...
113
click to vote
INFORMATICALT
2000
15 years 5 days 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...
102
Voted
LATA
2009
Springer
15 years 7 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...
100
Voted
GROUP
1997
ACM
15 years 4 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
15 years 14 days 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...