On the Non-deterministic Communication Complexity of Regular Languages

Anil Ada. On the Non-deterministic Communication Complexity of Regular Languages. In Masami Ito, Masafumi Toyama, editors, Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings. Volume 5257 of Lecture Notes in Computer Science, pages 96-107, Springer, 2008. [doi]

@inproceedings{Ada08,
  title = {On the Non-deterministic Communication Complexity of Regular Languages},
  author = {Anil Ada},
  year = {2008},
  doi = {10.1007/978-3-540-85780-8_7},
  url = {http://dx.doi.org/10.1007/978-3-540-85780-8_7},
  researchr = {https://researchr.org/publication/Ada08},
  cites = {0},
  citedby = {0},
  pages = {96-107},
  booktitle = {Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings},
  editor = {Masami Ito and Masafumi Toyama},
  volume = {5257},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-85779-2},
}