Sciweavers

1246 search results - page 120 / 250
» Recursive Timed Automata
Sort
View
171
Voted
DLOG
2007
15 years 7 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
153
Voted
JAC
2008
15 years 6 months ago
Quantization of cellular automata
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
Pablo Arrighi, Vincent Nesme
145
Voted
AAAI
1992
15 years 6 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
154
Voted
IJAC
2007
99views more  IJAC 2007»
15 years 5 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
RAS
2006
86views more  RAS 2006»
15 years 5 months ago
Using cellular automata and gradients to control self-reconfiguration
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
Kasper Støy