{"title":"On the membership problem for finite automata over symmetric groups","authors":"Arthur A. Khashaev","doi":"10.1515/dma-2022-0033","DOIUrl":null,"url":null,"abstract":"Abstract 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.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"32 1","pages":"383 - 389"},"PeriodicalIF":0.3000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2022-0033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1
Abstract
Abstract 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.
期刊介绍：
The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
