762 search results - page 9 / 153 » Intercode Regular Languages |
HYBRID
1998
Springer
13 years 11 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
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...
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...