230 search results - page 23 / 46 » The Inclusion Problem for Regular Expressions |
FUIN
2006
13 years 7 months ago
2006
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
CVPR
2008
IEEE
13 years 7 months ago
2008
IEEE
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
TACS
2001
Springer
14 years 18 hour ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...