Queues, Stacks, and Transcendentality at the Transition to Chaos

Details Queues, Stacks, and Transcendentality at the Transition to Chaos Queues, Stacks, and Transcendentality at the Transition to Chaos

1998-12-09

arxiv.org/abs/chao-dyn/9812016v1

Mathematics

Dynamical Systems

Scientific paper

We examine the one-humped map at the period-doubling transition to chaos, and ask whether its long-term memory is stack-like (last-in, first-out) or queue-like (first-in, first-out). We show that it can be recognized by a real-time automaton with one queue, or two stacks, and give several new grammatical characterizations of it. We argue that its memory has a queue-like character, since a single stack does not suffice. We also show that its dynamical zeta function, generating function and growth function are transcendental. The same results hold for any period-multiplying cascade. We suggest that transcendentality might be a sign of dynamical phase transitions in other systems as well.

Affiliated with

Also associated with

No associations

Rating

Queues, Stacks, and Transcendentality at the Transition to Chaos does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Queues, Stacks, and Transcendentality at the Transition to Chaos, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Queues, Stacks, and Transcendentality at the Transition to Chaos will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310078