CORR
2010
Springer
13 years 11 months ago
2010
Springer
We present an algorithm for computing directly the denotation of a modal
AAAI
1994
14 years 25 days ago
1994
Using the methods demonstrated in this paper, a robot with an unknown sensorimotor system can learn sets of features and behaviors adequate to explore a continuous environment and...
DLT
2010
14 years 29 days ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
ECAL
1995
Springer
14 years 3 months ago
1995
Springer
We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by...
ATVA
2006
Springer
14 years 3 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
HPDC
1996
IEEE
14 years 3 months ago
1996
IEEE
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursi...
LICS
1997
IEEE
14 years 3 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
ICALP
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
LATIN
2004
Springer
14 years 4 months ago
2004
Springer
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expr...
ISOLA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...