25 search results - page 2 / 5 » On Interacting Automata with Limited Nondeterminism |
134
click to vote
MFCS
1998
Springer
15 years 9 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...
160
click to vote
FCT
2009
Springer
16 years 16 days 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 ...
155
click to vote
CONCUR
2009
Springer
16 years 16 days 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). ...
127
click to vote
ENTCS
2007
15 years 6 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...
162
click to vote
ETAI
1998
15 years 5 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...