Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Group Theory

arXiv:1511.01630 (math)
[Submitted on 5 Nov 2015 (v1), last revised 3 Mar 2016 (this version, v2)]

Title:Cayley automatic representations of wreath products

Authors:Dmitry Berdinsky, Bakhadyr Khoussainov
View PDF
Abstract:We construct the representations of Cayley graphs of wreath products using finite automata, pushdown automata and nested stack automata. These representations are in accordance with the notion of Cayley automatic groups introduced by Kharlampovich, Khoussainov and Miasnikov and its extensions introduced by Elder and Taback. We obtain the upper and lower bounds for a length of an element of a wreath product in terms of the representations constructed.
Comments: Final version, to appear in the International Journal of Foundations of Computer Science
Subjects: Group Theory (math.GR); Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:1511.01630 [math.GR]
  (or arXiv:1511.01630v2 [math.GR] for this version)
  https://doi.org/10.48550/arXiv.1511.01630
Journal reference: Berdinsky D., Khoussainov B., "Cayley automatic representations of wreath products", International Journal of Foundations of Computer Science, V. 27, N 2, pp. 147-159 (2016)
Related DOI: https://doi.org/10.1142/S0129054116400049

Submission history

From: Dmitry Berdinsky [view email]
[v1] Thu, 5 Nov 2015 07:17:32 UTC (61 KB)
[v2] Thu, 3 Mar 2016 20:57:34 UTC (72 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.GR
< prev   |   next >
new | recent | 2015-11
Change to browse by:
cs
cs.FL
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)