1052 search results - page 38 / 211 » The Regular Real-Time Languages |
104
click to vote
ECHT
1992
15 years 7 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...
139
Voted
COCOON
2006
Springer
15 years 7 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...
149
Voted
LATA
2011
Springer
14 years 6 months ago
2011
Springer
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
132
click to vote
FUIN
2007
15 years 3 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...
118
Voted
JALC
2007
15 years 3 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...