759 search results - page 9 / 152 » Odometers on Regular Languages |
ECHT
1992
13 years 11 months ago
1992
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
DLT
2009
13 years 5 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
FUIN
2007
13 years 7 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
JALC
2007
13 years 7 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...