rpoldrac@s.psych.uiuc.edu (Russ Poldrack) (06/22/91)
I would like to write a program that will give all the possible legal n-letter strings from a finite-state grammar (Markov structure). I tried to conceptualize it as a tree-search problem, but I had problems related to keeping track of the tree level and terminating the search at a certain level. Does anyone know of a general algorithm by which to do such a task? Any help would be much appreciated. Are there any other newsgroups to which this would be more appropriate? Russ Poldrack Psychology Univ. of Illinois