759 search results - page 1 / 152 » Overlap-Free Regular Languages |
COCOON
2006
Springer
13 years 9 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...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
DLT
2009
13 years 3 months ago
2009
Abstract. We consider algorithms for approximating context
ADBIS
2009
Springer
13 years 12 months ago
2009
Springer
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.