En
Ru
Login
About
General information
Peer-reviewing
Editorial policy
Open access policy
Indexing
Contacts
Editorial
Editor-in-Chief
Editorial board
Issues
Issues
All Articles
Articles by Authors
Author Center
Conditions for reviewing the material
Ethical guidelines
ISSN 0278-6419 (*printed)
ISSN 1934-8428 (electronic version)
ISSN 0278-6419 (*printed)
ISSN 1934-8428 (electronic version)
Log In
Log In
Password:
Forgot your password?
En
Ru
About
About
General information
Peer-reviewing
Editorial policy
Open access policy
Indexing
Contacts
Editorial
Editorial
Editor-in-Chief
Editorial board
Issues
Issues
Issues
All Articles
Articles by Authors
Author Center
Author Center
Conditions for reviewing the material
Ethical guidelines
Search
Search
Main
Authors
Khashaev A. A.
Khashaev A. A.
Khashaev A. A.
Lomonosov Moscow State University (MSU)
E-mail:
arthur@khashaev.ru
Publications
On the cardinality computation problem for regular language over symmetric groups
Moscow University Journal. Series 15. Computational Mathematics and Cybernetics 2024. № 2. p. 58-64
Khashaev A. A.
read more
14
We consider representations of regular languages over symmetric groups such as finite automata and regular expressions. We show that the problem of computing cardinality of such representations is NP-hard.
Keywords:
regular languages, finite automata, groups, permutations, computational complexity
