200 search results - page 32 / 40 » Symbolic Equivalences for Open Systems |
TCS
2010
13 years 6 months ago
2010
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
TACAS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
ICRA
2003
IEEE
14 years 27 days ago
2003
IEEE
— The goal of this study is a system for a robot to imitate human dances. This paper describes the process to generate whole body motions which can be performed by an actual bipe...
AAAI
2007
13 years 10 months ago
2007
The importance of the efforts towards integrating the symbolic and connectionist paradigms of artificial intelligence has been widely recognised. Integration may lead to more e...
MCU
1998
13 years 9 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...