On the Complexity of Decidable Cases of Commutation Problem for Languages.

Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter

Browse the full FCT paper archive.