Generating fixed-length sequences satisfying any givennth-order transition probability matrix
- 1 June 1999
- journal article
- Published by Springer Nature in Behavior Research Methods, Instruments & Computers
- Vol. 31 (2) , 235-243
- https://doi.org/10.3758/bf03207715
Abstract
An experimental design involving sequences ofm distinct events can be conceptualized as annthorder transition probability matrix specifying the probabilities with which each of themdistinct events is to follow certainn-grams. This paper describes a general method for constructing sequences of shortest possible length that satisfy any such matrix and presents a computer program that randomly generates such sequences.Keywords
This publication has 4 references indexed in Scilit:
- Computer program for quasi-random stimulus sequences with equal transition frequenciesBehavior Research Methods, Instruments & Computers, 1995
- On eulerian circuits and words with prescribed adjacency patternsJournal of Combinatorial Theory, Series A, 1975
- Sequential determinants of information processing in serial and discrete choice reaction time.Psychological Review, 1969
- Sequential Redundancy and Speed in a Serial Two-Choice Responding TaskQuarterly Journal of Experimental Psychology, 1961