On a hierarchy of slender languages based on control sets

Research output: Contribution to journalArticle

Abstract

We study slender context-sensitive languages, i.e., those containing at most a constant number of words of each length. Recently, it was proved that every slender regular language can be described by a finite union of terms of the form uviw [9] and every slender context-free language can be described by a finite union of terms of the form uviwxi y [4, 10]. We show a hierarchy of slender languages which is properly contained in the family of context-sensitive languages and which starts with the family of slender context-free languages, or slender regular languages. Each slender context-sensitive language in the hierarchy can be described by a finite union of terms of the form x1y1ix2y2 i⋯xnynixn+1.

Original languageEnglish
Pages (from-to)41-47
Number of pages7
JournalFundamenta Informaticae
Volume31
Issue number1
DOIs
Publication statusPublished - 1997 Jul

Keywords

  • Control sets
  • Cryptosystems
  • Slender languages

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On a hierarchy of slender languages based on control sets'. Together they form a unique fingerprint.

  • Cite this