Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by making the call-return edges visible and by making the clock-reset operation visible, respectively—recover decidabili...

We consider a computational model which is known as set automata. The automata are one-way finite with additional storage—the set. There two kinds of automata—deterministic (DSA's) and nondeterministic (NSA's). was introduced by Kutrib, Malcher, Wendlandt in 2014. It shown that DSA-recognizable languages look similar to DCFL's NSA-recognizable CFL's. In this paper, we extend similarity prove re...

Interrupt Timed Automata (ITA ) form a subclass of stopwatch automata where reachability and some variants timed model checking are decidable even in presence parameters. They well suited to analyze real-time operating systems. Here we extend ITA with polynomial guards updates, leading the class (PolITA ). We prove that is 2EXPTIME on PolITA, using an adaptation cylindrical algebraic decomposit...

The cellular learning automata, which is a combination of cellular automata, and learning automata, is a new recently introduced model. This model is superior to cellular automata because of its ability to learn and is also superior to a single learning automaton because it is a collection of learning automata which can interact with each other. The basic idea of cellular learning automata, whi...

Totalistic cellular automata were introduced by Wolfram [1, 2] as a means of studying higher-color cellular automata within a reasonable space of possible rules. The underlying principle is to systematically construct a subset of rules within all the possible rules of the highercolor cellular automata, and the system in totalistic cellular automata is to add up the values of the cells within th...

We study tree series and weighted tree automata over unranked trees. The message is that recognizable tree series for unranked trees can be defined and studied from recognizable tree series for binary representations of unranked trees. For this we prove results of [1] as follows. We extend hedge automata – a class of tree automata for unranked trees – to weighted hedge automata. We define weigh...

In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are homeomorphic to cellular automata acting on a specific subshift.We show that the existing topological results for sand automata, including the Hedlund-like...

This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some of the known links between Mealy, Moore and RabinScott automata are translated into isomorphisms of categories, and we also show how behavioural automata connect to these automata. Considering the distinction between fi...