Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
In this article, we show how a behavior based control system for autonomous robots can be modeled as a hybrid automaton, where each node corresponds to a distinct robot behavior. T...
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...