On the cardinality computation problem for regular languages over symmetric groups

DOI10.3103/S0278641924700079MaRDI QIDQ6572947zbMATH OpenFDO

Authors Arthur A. Khashaev

Publication date 16 July 2024

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

permutationscomputational complexitygroupsfinite automataregular languages

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computability and recursion theory (03Dxx) General logic (03Bxx)

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3559545 (Why is no real title available?)
• scientific article; zbMATH DE number 953819 (Why is no real title available?)
• Elements of automata theory. Translated from the French by Reuben Thomas
• On the membership problem for finite automata over symmetric groups
• Programming Techniques: Regular expression search algorithm
• Properties of substitutions and unifications
• Semigroup program models

This page was built for publication: On the cardinality computation problem for regular languages over symmetric groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572947)