An analysis of some conditions for representingN state Markov processes as general all or none models
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Psychometrika.
Volume (Year): 34 (1969)
Issue (Month): 4 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=112911
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- James Greeno & Theodore Steiner, 1964. "Markovian processes with identifiable states: General considerations and application to all-or-none learning," Psychometrika, Springer, vol. 29(4), pages 309-333, December.
- Henry Halff, 1976. "Precriterion stationarity in markovian learning models," Psychometrika, Springer, vol. 41(3), pages 301-320, September.
- Bert Green, 1986. "Models, computers and policies: Fifty years of Psychometrika," Psychometrika, Springer, vol. 51(1), pages 65-68, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.