Sciweavers

759 search results - page 21 / 152
» Overlap-Free Regular Languages
Sort
View
AML
2008
84views more  AML 2008»
13 years 7 months ago
Model theory of the regularity and reflection schemes
Abstract. This paper develops the model theory of ordered structures that satisfy Keisler's regularity scheme, and its strengthening REF(L) (the reflection scheme) which is an...
Ali Enayat, Shahram Mohsenipour
DLT
2010
13 years 10 months ago
Computing Blocker Sets for the Regular Post Embedding Problem
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
Pierre Chambart, Philippe Schnoebelen
FSTTCS
2005
Springer
14 years 2 months ago
Causal Closure for MSC Languages
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...
Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, V...
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 1 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
VL
2007
IEEE
157views Visual Languages» more  VL 2007»
14 years 2 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