Scholarlink

Abstract <p>In this paper, we consider the operation of unambiguous multiplication of formal languages. It can be derived from the regular language concatenation by restricting the words of resulting language to be unambiguously represented as concatenations of words from the factor languages. A full characterization of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11970_2025_7223_Article_IEq1.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(\otimes\)</EquationSource> <!--BMatMGU2570047Kholodilov-m1--> </InlineEquation>-factorizations of a free monoid over a singleton generator is given. The existence of a representation of a free monoid as an unambiguous multiplication of languages that are not recursively enumerable is derived as a corollary.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Unambiguous Multiplication of Formal Languages

  • 期刊论文

  • 发表日期：

    2025年8月1日

查看全文
  • F. D. Kholodilov

摘要

Abstract

In this paper, we consider the operation of unambiguous multiplication of formal languages. It can be derived from the regular language concatenation by restricting the words of resulting language to be unambiguously represented as concatenations of words from the factor languages. A full characterization of \(\otimes\) -factorizations of a free monoid over a singleton generator is given. The existence of a representation of a free monoid as an unambiguous multiplication of languages that are not recursively enumerable is derived as a corollary.