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

On the Cardinality Computation Problem for Regular Languages over Symmetric Groups

  • 期刊论文

  • 发表日期：

    2024年6月11日

查看全文
  • A. A. Khashaev

摘要

Abstract

Representations of regular languages over symmetric groups in the form of finite automata and regular expressions are considered. The NP-hardness of deciding the cardinality of a language for such representations is proven.