Sciweavers

CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 3 months ago
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems
We present an algorithm for computing directly the denotation of a modal
Matthew Hague, C.-H. Luke Ong
AAAI
1994
13 years 5 months ago
Learning to Explore and Build Maps
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...
David Pierce, Benjamin Kuipers
DLT
2010
13 years 5 months ago
On the Average Number of States of Partial Derivative Automata
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...
Sabine Broda, António Machiavelo, Nelma Mor...
ECAL
1995
Springer
13 years 7 months ago
A New Self-Reproducing Cellular Automaton Capable of Construction and Computation
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...
Gianluca Tempesti
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
13 years 7 months ago
On the Construction of Fine Automata for Safety Properties
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...
Orna Kupferman, Robby Lampert
HPDC
1996
IEEE
13 years 7 months ago
Mobile Processing in Open Systems
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...
Peter Sapaty
LICS
1997
IEEE
13 years 7 months ago
Ground Reducibility is EXPTIME-Complete
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...
Hubert Comon, Florent Jacquemard
ICALP
1998
Springer
13 years 7 months ago
Power of Cooperation and Multihead Finite Systems
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...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...
LATIN
2004
Springer
13 years 9 months ago
How Expressions Can Code for Automata
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...
Sylvain Lombardy, Jacques Sakarovitch
ISOLA
2004
Springer
13 years 9 months ago
Embedding Finite Automata within regular Expressions
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...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah