Modèles d'apprentissage «stimulus-réponse» en termes d'automates

G. Ferrand

Mathématiques et Sciences Humaines (1983)

  • Volume: 84, page 5-43
  • ISSN: 0987-6936

How to cite

top

Ferrand, G.. "Modèles d'apprentissage «stimulus-réponse» en termes d'automates." Mathématiques et Sciences Humaines 84 (1983): 5-43. <http://eudml.org/doc/94296>.

@article{Ferrand1983,
author = {Ferrand, G.},
journal = {Mathématiques et Sciences Humaines},
keywords = {stimulus response learning models; learning processes; probabilistic automata network},
language = {fre},
pages = {5-43},
publisher = {Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique},
title = {Modèles d'apprentissage «stimulus-réponse» en termes d'automates},
url = {http://eudml.org/doc/94296},
volume = {84},
year = {1983},
}

TY - JOUR
AU - Ferrand, G.
TI - Modèles d'apprentissage «stimulus-réponse» en termes d'automates
JO - Mathématiques et Sciences Humaines
PY - 1983
PB - Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
VL - 84
SP - 5
EP - 43
LA - fre
KW - stimulus response learning models; learning processes; probabilistic automata network
UR - http://eudml.org/doc/94296
ER -

References

top
  1. [1] Arbib M.A., Theories of abstract automata, Englewood Cliffs, N.J., Prentice Hall, 1969. Zbl0193.32801MR321626
  2. [2] Arbib M.A., "Memory limitations of stimulus-response models ", Suppes P., "Stimulus-response theory of automata : a reply to Arbib", Psychological Review, 76 (1969), 507-514. 
  3. [3] Derrick J., Réflexions préalables à une étude de la représentation des situations d'apprentissage par les automates, Orleans et Leeds, IREM, 1975. 
  4. [4] Ferrand G., Modèles en termes d'automates : questions de fondements logiques, et application à des processus d'apprentissage "Stimulus-Réponse", Orléans, Thèse de 3ème cycle, 1982, Université d'Orléans. 
  5. [5] Ferrand G., "On logical foundations of probabilistic automata networks : syntax and semantic", à paraître. 
  6. [6] Kieras D.E., "Finite automata and S-R Models", Journal of Math. psychology, 13 (1976), 127-147. Zbl0338.94026MR484566
  7. [7] Nelson R.J., Introduction to automata, New York, J. Wiley, 1968. Zbl0165.02201MR229487
  8. [8] Nelson R.J., "Behaviorism is false", The journal of philosophy, LXVI n° 14 (1969), 417-452. 
  9. [9 ] Nelson R.J., "Behaviorism, finite automata and stimulus-réponse theory", Theory and decision, 6 (1975), 249-267. Zbl0318.94042
  10. [10] Paz A., Introduction to probabilistic automata, New York, Academic Press, 1971. Zbl0234.94055MR289222
  11. [11] Rouanet H., Les modèles stochastiques d'apprentissage, Paris, Gauthier-Villars, 1967. 
  12. [12] Starke P.H., Abstract automata, Amsterdam, North-Holland, 1972. Zbl0225.94035MR344026
  13. [13] Estes W.K., Suppes P., Foundations of statistical learning theory II. The Stimulus-Sampling Model, Technical report n° 26, Stanford, Institute for mathematical studies in the social sciences, 1959. 
  14. [14] Suppes P., "Stimulus response theory of finite automata ", Journal of math. psychology, 6(1969), 327-355. Zbl0184.45701
  15. [15] Suppes P., "From behaviorism to neobehaviorism", theory and decision, 6(1975), 269-285. Zbl0318.94043

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.