Since every hypercode is finite, one may ask for the significance of the property that a language L admits a uniform upper bound on the size of hypercodes included in L . Such a language L is called h-bounded . We prove that a rational language L is h -bounded iff it is thin iff it is semi-discrete , i.e., L contains at most k words of any given length for some fixed k ∈ ℕ. Moreover, a representation of these languages by regular expressions is established. Concerning the general case, some properties of the syntactic monoid Synt( L ) of an h -bounded (semi-discrete) language are derived. If L is not disjunctive, then Synt( L ) contains a zero element. Every subgroup of Synt( L ) is a finite cyclic group. The idempotents of Synt( L )\{0, 1~ form an antichain with respect to the usual partial order.
[1]
M. Schützenberger,et al.
The equation $a^M=b^Nc^P$ in a free group.
,
1962
.
[2]
Tom Head,et al.
Hypercodes in Deterministic and Slender 0L Languages
,
1980,
Inf. Control..
[3]
C. M. Reis,et al.
Some Properties of Disjunctive Languages on a Free Monoid
,
1978,
Inf. Control..
[4]
Michael A. Harrison,et al.
Introduction to formal language theory
,
1978
.
[5]
G. Lallement.
Semigroups and combinatorial applications
,
1979
.
[6]
H. Shyr.
Free monoids and languages
,
1979
.
[7]
Jacques Sakarovitch,et al.
A Theory of Syntactic Monoids for Context-Free Languages
,
1977,
IFIP Congress.
[8]
Graham Higman,et al.
Ordering by Divisibility in Abstract Algebras
,
1952
.