4666 search results - page 155 / 934 » Equations on Timed Languages |
125
click to vote
RP
2010
Springer
15 years 3 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
184
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Shrinkage-based exponential language models, such as the recently introduced Model M, have provided significant gains over a range of tasks [1]. Training such models requires a l...
137
click to vote
CSL
2009
Springer
16 years 1 days ago
2009
Springer
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...
147
click to vote
VLDB
1992
ACM
15 years 9 months ago
1992
ACM
The integration of object-oriented concepts into deductive databases has been investigated for a certain time now. Various approaches to incorporate updates into deduction have be...
160
click to vote
CSFW
1998
IEEE
15 years 9 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...