Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!mp.cs.niu.edu!ux1.cso.uiuc.edu!s.psych.uiuc.edu!rpoldrac
From: rpoldrac@s.psych.uiuc.edu (Russ Poldrack)
Newsgroups: comp.sys.mac.programmer
Subject: Data Structure problem: Finite state grammar
Message-ID: <1991Jun22.001508.6756@ux1.cso.uiuc.edu>
Date: 22 Jun 91 00:15:08 GMT
Sender: usenet@ux1.cso.uiuc.edu (News)
Organization: University of Illinois at Urbana
Lines: 12

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