When Does Partial Commutative Closure Preserve Regularity?

DOI10.1007/978-3-540-70583-3_18zbMATH Open1155.68416OpenAlexW1567402404MaRDI QIDQ3519503FDOQ3519503

Authors: Antonio Cano Gómez, Jean-Éric Pin, Giovanna Guaiana 

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_18

Recommendations

• Regular languages and partial commutations
• A note on the commutative closure of star-free languages
• scientific article; zbMATH DE number 1222104
• A Robust Class of Regular Languages
• scientific article; zbMATH DE number 2155196

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• Regular languages and partial commutations
• When does (t ^r )-Regularity imply (a ^r )-Regularity?
• Partially-commutative context-free languages
• Efficiency of automata in semi-commutation verification techniques
• A Robust Class of Regular Languages

This page was built for publication: When Does Partial Commutative Closure Preserve Regularity?

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