A language is called a relatively regular language if its syntactic monoid has finite ideals. In this paper, we show that there are close relationships between the relatively regular languages and some other classes of languages such as (generalized) disjunctive languages, fd-domains and 2-codes. In particular, we prove that every relatively regular 2-code is thin. Thus, the well known result of Bestel and Perrin in 1985 becomes an easy corollary of our result.

Relatively regular languages and thin codes

Relatively Disjunctive Languages and Relatively Regular Languages

Semigroup method and Combinatorics method are two important techniques in the study of words and languages. This paper presents the semigroup method and explore languages by using semigroup method. Some algebraic properties of languages be given via semigroup method. Firstly, the semigroup constructions of dense languages are given. It’s proved that every dense language which syntactic monoid has the zero, or which syntactic monoid has the minimal ideal and this ideal is a periodic semigroup having a primitive idempotent contains a language w(w k) * for some nonempty word w and some positive integer k. The theorem every code is thin is generalized to the result that every code which syntactic monoid has the zero, or which syntactic monoid has the minimal ideal and this ideal is a periodic semigroup having a primitive idempotent is thin. It’s proved that every dense regular language contains a product of some word with some dense regular right unitary submonoid of A *, and by using this result it is proved that every dense regular language also contains a primitive word. Secondly, the regular component decomposition of free monoids are given. It’s proved that free monoids are regular component splittable and that every product of a regular component splittable language with a regular component splittable suffix language is regular component splittable. As applications of the above results two conjectures about regular languages given by Shyr and Yu, in 1998 are proved. The two conjectures are that regular languages are regular component splittable and dense regular languages contains imprimitive words.

Semigroup Method in Combinatorics on Words

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Liu Yao

Author Tools

Chat about Author

Papers

Semigroup Method in Combinatorics on Words