Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread Kent Johnson
On Mon, Oct 12, 2009 at 10:47 AM, Kent Johnson wrote: > On Mon, Oct 12, 2009 at 10:09 AM, kevin parks wrote: >> Yeah i don't mean an infinite loop, but more like a perpetual dance back and >> forth between to items >> that point to each other. I think I need to be careful when i define the >> ru

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread Alan Gauld
"kevin parks" wrote I been using that flatten function since 1970. Prolly pilfered from Tim Peters or Effbot. Are you sure about that date? If you did get it from Tim or F/ it certainly wouldn't have been in Python back then! :-) Alan G

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread Dave Angel
kevin parks wrote: On Oct 12, 2009, at 8:02 PM, Dave Angel wrote: Often, when a combination of existing stdlib collection types gets too confusing, it's time to consider classes and objects. Not necessarily to make the program "object oriented," but to make the program data structure unders

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread Kent Johnson
On Mon, Oct 12, 2009 at 10:09 AM, kevin parks wrote: >> > I don't understand why you want to flatten outlist; when I run your >> > program I get one number per line, not one generation per line as you >> > show above. > > > That's odd. Anyway in my program I am printing the list twice. The first >

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread kevin parks
On Oct 12, 2009, at 8:02 PM, Dave Angel wrote: Often, when a combination of existing stdlib collection types gets too confusing, it's time to consider classes and objects. Not necessarily to make the program "object oriented," but to make the program data structure understandable. That

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread kevin parks
> You might be interested in Steven Wolfram's book, "A New Kind of > Science" and the many examples on his web site: > http://www.wolframscience.com/ See Wikipedia as well. This is a very > rich area. Thanks. That was just the kind of reference I was looking for. Fantastic. I am sure i wont

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread Kent Johnson
On Mon, Oct 12, 2009 at 5:01 AM, kevin parks wrote: > First, as i mentioned I would like to know what, precisely, this kind of > process is called so that i can look it up. It looks like a simple cellular automaton where a cell's neighborhood includes only the cell itself. You might be interested

Re: [Tutor] Automaton/transitional grammar query

2009-10-12 Thread Dave Angel
kevin parks wrote: I posted about this a couple weeks back, but then got horribly ill and dropped the ball so i was hoping to revisit. I am not sure if this is and example of Finite Automaton or a Finite State Machine or perhaps it is related to a transition table or markov process. I think