Sciweavers

759 search results - page 38 / 152
» Odometers on Regular Languages
Sort
View
CAAP
1994
15 years 1 months ago
Some Results on Top-Context-Free Tree Languages
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...
Dieter Hofbauer, Maria Huber, Gregory Kucherov
VL
2007
IEEE
157views Visual Languages» more  VL 2007»
15 years 4 months ago
Spider Diagrams of Order
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
Aidan Delaney, Gem Stapleton
CP
2000
Springer
15 years 2 months ago
A Language for Audiovisual Template Specification and Recognition
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
Jean Carrive, Pierre Roy, François Pachet, ...
IJAC
2007
64views more  IJAC 2007»
14 years 10 months ago
Star-Free Geodesic Languages for Groups
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...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
CP
2006
Springer
15 years 1 months ago
The Theory of Grammar Constraints
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
Meinolf Sellmann