3653 search results - page 144 / 731 » On Recognizable Timed Languages |
LREC
2008
14 years 11 months ago
2008
Our goal is to provide a web-based platform for the long-term preservation and distribution of a heterogeneous collection of linguistic resources. We discuss the corpus preprocess...
100
Voted
PEPM
1999
ACM
15 years 2 months ago
1999
ACM
A certifying compiler takes a source language program and produces object code, as well as a certi cate" that can be used to verify that the object code satis es desirable pr...
98
Voted
OSDI
1996
ACM
14 years 11 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
ICALP
2010
Springer
15 years 3 days ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...