4502 search results - page 395 / 901 » Regular Model Checking |
165
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
170
click to vote
CAI
2009
Springer
16 years 1 months ago
2009
Springer
The aim of this paper is to collect definitions and results on the main classes of 2D languages introduced with the attempt of generalizing regular and context-free string languag...
170
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
In this article, we show how a behavior based control system for autonomous robots can be modeled as a hybrid automaton, where each node corresponds to a distinct robot behavior. T...
219
click to vote
IJCAI
2001
15 years 8 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
168
click to vote
ENTCS
2007
15 years 6 months ago
2007
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...