Partially-commutative context-free languages

MaRDI QIDQ4986258zbMATH OpenFDO

Authors Wojciech Czerwiński, Sławomir Lasota

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2747, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS12.4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Remarks about commutative context-free languages
• When Does Partial Commutative Closure Preserve Regularity?
• scientific article; zbMATH DE number 897900
• Languages under concatenation and shuffling
• A note on the commutative closure of star-free languages

Cited in

(6)

• Regular languages and partial commutations
• Remarks about commutative context-free languages
• On commutative context-free languages
• scientific article; zbMATH DE number 4035186 (Why is no real title available?)
• Partial Commutation on Array Languages
• Regular and linear permutation languages

This page was built for publication: Partially-commutative context-free languages

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