"On the Computational Complexity of Context-Free Parallel Communicating ..."

Stefan D. Bruda (1997)

Details and statistics

DOI: 10.1007/3-540-62844-4_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-22

a service of  Schloss Dagstuhl - Leibniz Center for Informatics