3653 search results - page 28 / 731 » On Recognizable Timed Languages |
KI
2008
Springer
14 years 9 months ago
2008
Springer
1 The investigation of linguistic expressions of space and time typically presupposes an interdependency between these two related conceptual domains, resulting in a quasi-metaphor...
108
click to vote
IFIPTCS
2000
15 years 1 months ago
2000
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
LCTRTS
1998
Springer
15 years 1 months ago
1998
Springer
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
PEPM
1993
ACM
15 years 1 months ago
1993
ACM
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...