Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

COMBINATORICS
2006

favoriteEmaildiscussreport

98views more COMBINATORICS 2006»

Restricted Walks in Regular Trees

13 years 4 months ago

Restricted Walks in Regular Trees

Download www.emis.de

Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.

Laura Ciobanu, Sasa Radomirovic

Real-time Traffic

Cayley Graph | Certain Time | COMBINATORICS 2006 | Free Group F |

claim paper

Related Content

» On the Power of TreeWalking Automata

» Deterministic random walks on regular trees

» Regular Protocols and Attacks with Regular Knowledge

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» Looping Caterpillars

» XPath transitive closure logic and nested tree walking automata

» Resolution Trees with Lemmas Resolution Refinements that Characterize DLL Algorithms with ...

» Maximum Entropy Rate of Markov Sources for Systems With Nonregular Constraints

» Linear SecondOrder Unification and Context Unification with TreeRegular Constraints

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Laura Ciobanu, Sasa Radomirovic

Comments (0)