Automata for the commutative closure of regular languages

DOI10.1016/J.JCSS.2026.103762MaRDI QIDQ6845956zbMATH OpenFDO

Authors Verónica Becher, Simón Lew Deveali, Ignacio Mollo Cunningham

Publication date 12 March 2026

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.2026.103762

zbMATH Keywords

commutative closurefinite-state automataregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• Bounded Regular Sets
• Elements of automata theory. Translated from the French by Reuben Thomas
• Factoring multivariate integral polynomials
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3353192 (Why is no real title available?)
• On the maximal order in S_n and S*_n
• Rational sets in commutative monoids
• State complexity bounds for the commutative closure of group languages
• The taming of the semi-linear set

This page was built for publication: Automata for the commutative closure of regular languages

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