#### Filter Results:

#### Publication Year

2007

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.

Zoraň Suni´c Cayley graph automatic groups are not necessarily Cayley grap

A connection relating Tamari lattices on symmetric groups regarded as lattices under the weak Bruhat order to the positive monoid P of Thompson group F is presented. Tamari congruence classes correspond to classes of equivalent elements in P. The two well known normal forms in P correspond to endpoints of intervals in the weak Bruhat order that determine… (More)

This note records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely generated group G has an element whose normal closure is abelian and of finite index, then G has a finite generating set… (More)

We study the sofic tree shifts of A Σ * , where Σ * is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X ⊂ A Σ * is a sofic tree shift, then the configurations in X whose orbit under the shift action is finite are dense in X, and, as a consequence of this, we deduce… (More)

We introduce the notion of a normal gallery, a gallery in which any configuration of guards that visually covers the walls necessarily covers the entire gallery. We show that any star gallery is normal and any gallery with at most two reflex corners is normal. A polynomial time algorithm is provided deciding if, for a given gallery and a finite set of… (More)

In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs (the smallest disk from one of the pegs is moved to the other peg), but also, simultaneously, between the… (More)

- Zoran Sunic
- IJAC
- 2011

- ‹
- 1
- ›