25 search results - page 2 / 5 » On Interacting Automata with Limited Nondeterminism |
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a lim...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
ENTCS
2007
13 years 7 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
ETAI
1998
13 years 7 months ago
1998
Any model of the world a robot constructs on the basis of its sensor data is necessarily both incomplete, due to the robot’s limited window on the world, and uncertain, due to s...