{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:02Z","timestamp":1725663602268},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194446"},{"type":"electronic","value":"9783540392705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19444-4_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:11:18Z","timestamp":1330182678000},"page":"53-67","source":"Crossref","is-referenced-by-count":2,"title":["Computation on finite networks of automata"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Tchuente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","unstructured":"Berstel, J., Quelques applications des r\u00e9seaux d'automates \u00e0 des probl\u00e8mes de la th\u00e9orie des graphes, Th\u00e8se de 3e cycle, Paris, 1967"},{"key":"5_CR2","volume-title":"Computer and Intractability A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"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"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0024-3795(81)90170-1","volume":"37","author":"K.H. Kim","year":"1981","unstructured":"Kim, K.H. and Roush, F.W., Realizing all linear transformations Linear Algebra and its Applications, 37,97\u2013101, 1981","journal-title":"Linear Algebra and its Applications"},{"key":"5_CR4","unstructured":"Kung, H.T., and Leiserson, C.E., Systolic arrays for VLSI, in Introduction to VLSI Systems, C. Mead and L. Conway, ed., 271\u2013292, Addison Wesley, 1980"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013265, Acad. press, 1973","DOI":"10.1016\/B978-1-4832-3187-7.50019-2"},{"key":"5_CR6","volume-title":"Sur les Bases du Groupe Sym\u00e9tri, que et les Couples de Substitutions qui Engendrent un Groupe R\u00e9gulier","author":"S. Piccard","year":"1946","unstructured":"Piccard, S., Sur les Bases du Groupe Sym\u00e9tri, que et les Couples de Substitutions qui Engendrent un Groupe R\u00e9gulier. Vuibert, Paris, 1946."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0024-3795(79)90136-8","volume":"28","author":"M. Tchuente","year":"1979","unstructured":"Tchuente, M., Parallel computation of a linear mapping on a computer network, Linear Algebra and its Applications 28, 223\u2013247, 1979","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0022-0000(83)90016-8","volume":"26","author":"M. Tchuente","year":"1983","unstructured":"Tchuente, M., Computation of boolean functions on networks of binary automata, Journal of Computer and System Sciences, 26,2, 269\u2013277, 1983","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR9","unstructured":"Tchuente, M., Contribution \u00e0 l'\u00e9tude des m\u00e9thodes de calcul pour des syst\u00e8mes de type coop\u00e9ratif, Th\u00e8se d'\u00e9tat, Grenoble, 1982"},{"issue":"3","key":"5_CR10","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0606052","volume":"6","author":"M. Tchuente","year":"1985","unstructured":"Tchuente, M., Permutation factorization on star connected networks of binary automata, Siam J. Alg. Disc. Meth., 6, 3, 537\u2013540, 1985","journal-title":"Siam J. Alg. Disc. Meth."},{"key":"5_CR11","unstructured":"Tchuente, M., Computation on binary tree-networks, to appear in Discrete Applied Mathematics"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(82)90143-1","volume":"39","author":"M. Tchuente","year":"1982","unstructured":"Tchuente, M., Parallel realization of permutations over trees, Discrete Mathematics, 39, 211\u2013214, 1982","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19444-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:17:16Z","timestamp":1605626236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19444-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194446","9783540392705"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-19444-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}