Abstract-- Spatial partial differential equations are commonly used to describe systems of biological entities, such as patterns created by desert vegetation and biovermiculation g...
Brian Strader, Keith E. Schubert, Ernesto Gomez, J...
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...