Decomposing permutation automata

DOI10.1016/J.JCSS.2025.103721MaRDI QIDQ6885362zbMATH OpenFDO

Authors Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf

Publication date 11 December 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103721

zbMATH Keywords

commutative languagescomputational complexitydecompositiondeterministic finite automatapermutation automataprimalityregular languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• Classifying regular languages via cascade products of automata
• Elementary Number Theory
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7559422 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 7730620 (Why is no real title available?)
• Parameterized algorithms
• Prime languages
• Ramanujan's proof of Bertrand's postulate
• Reversibility of computations in graph-walking automata

This page was built for publication: Decomposing permutation automata

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