It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable Baumslag-Solitar groups BS(1, m), for m 6= ±1. In addition, it is shown that, for any relatively prime integers m, n ≥ 2, the pair of Baumslag-Solitar groups BS...

In this paper we give a complete classification of the infinite Schreier graphs of an automaton group generated by an extended version of the binary adding machine.

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

Based on cellular automaton and multi-agent model, we propose a novel hybrid model for distributed simulation of train-group in the railway traffic. An improved cellular automaton model is designed for simulating the underlying structure of the railroad and a multi-agent model is used for dynamic scheduling of the train-group. The combination of both models answers for the distributed simulatio...

We present here a construction for the derived term automaton (aka partial derivative, or Antimirov, automaton) of rational (or regular) expression based on sole induction depth and without making reference to an operation derivation expression. It is particularly well-suited case weighted expressions.

we present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. first, we introduce a hyper bck-algebra induced by a max-min general fuzzy automaton. then, we study the properties of this hyper bck-algebra. particularly, some theorems and results for hyper bck-algebra are proved. for example, it is shown that this structure consists of different ty...

in this paper we proposed a cellular automaton based local algorithm to solve the autonomously sensor gathering problem in mobile wireless sensor networks (mwsn). in this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. the sensors decide to move only based on their local information. cellular automaton (ca) as dynamical sy...

Sampling-based motion planners are a central tool for solving motionplanning problems in a variety of domains, but the theoretical understanding of their behavior remains limited, in particular with respect to the quality of the paths they generate (in terms of path length, clearance, etc.). In this paper we prove, for a simple family of obstacle settings, that the popular dual-tree planner Bi-...

Replication and load-balancing are two fundamental techniques for improving availability and performance of distributed systems. However, correct and eecient realization of these techniques is intricate when the distributed environment may partition and merge because of processor and communication failures. In this thesis, we show how a view-synchronous group communication service recently spec...