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

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter (2001)

Details and statistics

DOI: 10.1007/3-540-44669-9_20

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics