555 search results - page 5 / 111 » Complexity of Operations on Cofinite Languages |
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
FLAIRS
2009
13 years 5 months ago
2009
For certain disable persons unable to communicate, we present a palliative aid which consist of a virtual pictographic keyboard associated to a text processing from a pictographic...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
CASES
2009
ACM
13 years 5 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...