Computation on finite networks of automata

  • Maurice Tchuente
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 316)


Bipartite Graph Boolean Function Boolean Matrix Boolean Matrice Binary Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Berstel, J., Quelques applications des réseaux d'automates à des problèmes de la théorie des graphes, Thèse de 3e cycle, Paris, 1967Google Scholar
  2. [2]
    Garey, M.R., and Johnson, D.S., Computer and Intractability A Guide to the Theory of NP-Completeness, Bell Telephone Lab., Murray Hill, New Jersey, 1979Google Scholar
  3. [3]
    Kim, K.H. and Roush, F.W., Realizing all linear transformations Linear Algebra and its Applications, 37,97–101, 1981Google Scholar
  4. [4]
    Kung, H.T., and Leiserson, C.E., Systolic arrays for VLSI, in Introduction to VLSI Systems, C. Mead and L. Conway, ed., 271–292, Addison Wesley, 1980Google Scholar
  5. [5]
    Rosenstiehl, P. et al., Intelligent graphs: networks of finite automata capable of solving graph problems, in Graph Th. and Comp., R.C. Read ed., 219–265, Acad. press, 1973Google Scholar
  6. [6]
    Piccard, S., Sur les Bases du Groupe Symétri, que et les Couples de Substitutions qui Engendrent un Groupe Régulier. Vuibert, Paris, 1946.Google Scholar
  7. [7]
    Tchuente, M., Parallel computation of a linear mapping on a computer network, Linear Algebra and its Applications 28, 223–247, 1979Google Scholar
  8. [8]
    Tchuente, M., Computation of boolean functions on networks of binary automata, Journal of Computer and System Sciences, 26,2, 269–277, 1983Google Scholar
  9. [9]
    Tchuente, M., Contribution à l'étude des méthodes de calcul pour des systèmes de type coopératif, Thèse d'état, Grenoble, 1982Google Scholar
  10. [10]
    Tchuente, M., Permutation factorization on star connected networks of binary automata, Siam J. Alg. Disc. Meth., 6, 3, 537–540, 1985Google Scholar
  11. [11]
    Tchuente, M., Computation on binary tree-networks, to appear in Discrete Applied MathematicsGoogle Scholar
  12. [12]
    Tchuente, M., Parallel realization of permutations over trees, Discrete Mathematics, 39, 211–214, 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Maurice Tchuente
    • 1
  1. 1.Faculté des Sciences Service d'InformatiqueYaoundéCameroun

Personalised recommendations