759 search results - page 1 / 152 » Overlap-Free Regular Languages |
COCOON
2006
Springer
15 years 1 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...
109
click to vote
CORR
2011
Springer
14 years 4 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
14 years 7 months ago
2009
Abstract. We consider algorithms for approximating context
ADBIS
2009
Springer
15 years 4 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
15 years 2 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.