Skip to main content
SpringerLink
Log in

Computation on finite networks of automata

  • Conference paper
  • First Online:
Automata Networks (LITP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 316))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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, 1967

    Google Scholar 

  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, 1979

    Google Scholar 

  3. Kim, K.H. and Roush, F.W., Realizing all linear transformations Linear Algebra and its Applications, 37,97–101, 1981

    Google Scholar 

  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, 1980

    Google Scholar 

  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, 1973

    Google Scholar 

  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. Tchuente, M., Parallel computation of a linear mapping on a computer network, Linear Algebra and its Applications 28, 223–247, 1979

    Google Scholar 

  8. Tchuente, M., Computation of boolean functions on networks of binary automata, Journal of Computer and System Sciences, 26,2, 269–277, 1983

    Google Scholar 

  9. Tchuente, M., Contribution à l'étude des méthodes de calcul pour des systèmes de type coopératif, Thèse d'état, Grenoble, 1982

    Google Scholar 

  10. Tchuente, M., Permutation factorization on star connected networks of binary automata, Siam J. Alg. Disc. Meth., 6, 3, 537–540, 1985

    Google Scholar 

  11. Tchuente, M., Computation on binary tree-networks, to appear in Discrete Applied Mathematics

    Google Scholar 

  12. Tchuente, M., Parallel realization of permutations over trees, Discrete Mathematics, 39, 211–214, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences Service d'Informatique, BP. 812, Yaoundé, Cameroun

    Maurice Tchuente

Authors
  1. Maurice Tchuente
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Choffrut

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tchuente, M. (1988). Computation on finite networks of automata. In: Choffrut, C. (eds) Automata Networks. LITP 1986. Lecture Notes in Computer Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19444-4_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-19444-4_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19444-6

  • Online ISBN: 978-3-540-39270-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation