Sciweavers

426 search results - page 36 / 86
» Synchronization of Regular Automata
Sort
View
FCT
2009
Springer
13 years 11 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
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...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
TCS
2008
13 years 7 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
FORMATS
2008
Springer
13 years 9 months ago
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
K. Mani Chandy, Sayan Mitra, Concetta Pilotto
HYBRID
2000
Springer
13 years 11 months ago
Behavior Based Robotics Using Hybrid Automata
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...
Magnus Egerstedt
MCU
1998
170views Hardware» more  MCU 1998»
13 years 9 months ago
About the Universality of the Billiard ball model
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...
Jérôme Olivier Durand-Lose