Generalized langford languages

Abstract

The term generalized Langford string is used to denominate Langford type strings over an alphabet A _n = {a ₁, a ₂,..., a _n }, that allow for at least i other symbols to occur before the next occurrence of the symbol a _i (1≦i≦n). The finitude of the corresponding languages as well as the inclusion relations existing between them are discussed and their place in Chomsky's hierarchy is established.

Keywords:

• Generalized Langford string
• finite language
• regular language

C.R. Categories:

• F.4.3
• G.2.1