759 search results - page 61 / 152 » Overlap-Free Regular Languages |
156
click to vote
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
132
click to vote
IEEEMSP
2002
IEEE
15 years 10 months ago
2002
IEEE
Abstract—We present the query-by-description (QBD) component of “Kandem,” a time-aware music retrieval system. The QBD system we describe learns a relation between descriptiv...
197
click to vote
CAAP
1994
15 years 8 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
278
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
133
click to vote
IJAC
2007
15 years 5 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...