The Numerical Semigroup of Phrases' Lengths in a Simple Alphabet
Let 𝒜 be an alphabet with two elements. Considering a particular class of words (the phrases) over such an alphabet, we connect with the theory of numerical semigroups. We study the properties of the family of numerical semigroups which arise from this starting point.
Main Authors: | Aureliano M. Robles-Pérez, José Carlos Rosales |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/459024 |
Similar Items
Similar Items
-
Union of Sets of Lengths of Numerical Semigroups
by: J. I. García-García, et al.
Published: (2020-10-01) -
Completely Simple Semigroups
by: Barker, Bruce W.
Published: (1968) -
Counting the Ideals with a Given Genus of a Numerical Semigroup with Multiplicity Two
by: M. A. Moreno-Frías, et al.
Published: (2021-05-01) -
On completely 0-simple semigroups
by: Yue-Chan Phoebe Ho
Published: (1996-01-01) -
The simple nominal phrase in Hausa
by: Galadanci, Muhammad K. M.
Published: (1969)