On the membership problem for finite automata over symmetric groups

被引：0
|
作者：
Khashaev A.A. [1 ]
机构：
[1] Lomonosov Moscow State University, Moscow
来源：
Discrete Mathematics and Applications | 2022年 / 32卷 / 06期
关键词：
computational complexity; finite automata; groups; permutations;
D O I：
10.1515/dma-2022-0033
中图分类号：
学科分类号：
摘要：
We consider automata in which transitions are labelled with arbitrary permutations. The language of such an automaton consists of compositions of permutations for all possible admissible computation paths. The membership problem for finite automata over symmetric groups is the following decision problem: does a given permutation belong to the language of a given automaton? We show that this problem is NP-complete. We also propose an efficient algorithm for the case of strongly connected automata. © 2022 Walter de Gruyter GmbH, Berlin/Boston.
引用
收藏
页码：389 / 395
页数：6
相关论文
共 50 条
12345