The Power of Diversity

  • Denis Thérien
Conference paper

DOI: 10.1007/978-3-642-22600-7_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Thérien D. (2011) The Power of Diversity. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

In computations realized by finite automata, a rich understanding has come from comparing the algebraic structure of the machines to the combinatorics of the languages being recognized. In this expository paper, we will first survey some basic ideas that have been useful in this model. In the second part, we sketch how this dual approach can be generalized to study some important class of boolean circuits, what results have been obtained, what questions are still open. The intuition gained in the simple model sometimes carry through, sometimes not, so that one has to be careful on what conjectures to make.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Denis Thérien
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontréalCanada

Personalised recommendations