Sciweavers

Share
LPAR
2010
Springer
8 years 4 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan
ORL
2006
73views more  ORL 2006»
8 years 6 months ago
Coordination through De Bruijn sequences
Let
Olivier Gossner, Penélope Hernández
CSL
2006
Springer
8 years 6 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
IANDC
2008
141views more  IANDC 2008»
8 years 6 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
ENDM
2008
82views more  ENDM 2008»
8 years 6 months ago
Repetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
Said Sadique Adi, Marília D. V. Braga, Cris...
ECCC
2008
117views more  ECCC 2008»
8 years 6 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...
books