Complete classifications for the communication complexity of regular languages
type: Item
instance of: scholarly article
title: Complete classifications for the communication complexity of regular languages
zbMATH Open document ID: 1066.68073
author: Pascal Tesson
author: Denis Thérien
published in: Theory of Computing Systems
publication date: 2005-04-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2159484
zbMATH Keywords: two-party communication complexity
MaRDI profile type: Publication
full work available at URL: s00224-004-1190-2
OpenAlex ID: W2071784365
DOI: 10.1007/S00224-004-1190-2
description: scientific article; zbMATH DE number 2159484