3653 search results - page 114 / 731 » On Recognizable Timed Languages |
102
click to vote
JMLR
2010
14 years 4 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
160
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
180
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
IJCNLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Temporal question classification assigns time granularities to temporal questions ac-cording to their anticipated answers. It is very important for answer extraction and ...
103
click to vote
ICALP
1997
Springer
15 years 2 months ago
1997
Springer
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...