Random walks on semaphore codes and delay de Bruijn semigroups

DOI10.1142/S0218196716500284zbMath1373.68292arXiv1509.03383OpenAlexW2239243856MaRDI QIDQ5739483

Anne Schilling, John L. Rhodes, Pedro V. Silva

Publication date: 15 July 2016

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.03383

zbMATH Keywords

random walkright congruenceshitting timesemaphore codesde Bruijn semigroupresets

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Graph representations (geometric and intersection representations, etc.) (05C62) Representation of semigroups; actions of semigroups on sets (20M30) Random walks on graphs (05C81)

Related Items (5)

Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Holonomy theorem for finite semigroups ⋮ Mixing time for Markov chain on linear extensions ⋮ Unified theory for finite Markov chains ⋮ The semaphore codes attached to a Turing machine via resets and their various limits

Cites Work

• Stationary Distribution and Eigenvalues for a de Bruijn Process
• FURTHER RESULTS ON MONOIDS ACTING ON TREES
• De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
• MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
• Markov chains, ${\mathscr R}$-trivial monoids and representation theory
• The semaphore codes attached to a Turing machine via resets and their various limits
• Normal Recurring Decimals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random walks on semaphore codes and delay de Bruijn semigroups