512 search results - page 5 / 103 » Automata as Abstractions |
IANDC
2008
13 years 7 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
JAC
2008
13 years 9 months ago
2008
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
NC
2010
13 years 5 months ago
2010
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
FCT
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...