top of page
Buscar

Stallings automata for free extensions

  • Jordi Delgado and Enric Ventura
  • 29 may 2019
  • 1 Min. de lectura

We generalize to extensions by free groups (G ⋊ 𝔽ₙ) the classical theory of Stallings describing subgroups of the free groups as automata.

This approach provides conditions for the solvability of the membership problem and provides insight on other important algorithmic problems for this family.

 
 
 

Entradas recientes

Ver todo

Comments


logo positiu.png

© 2017 by Jordi Delgado Rodríguez

  • arxiv_sq
  • RG_logo
  • google_scholar
  • mathscinet-logo
  • logo_ORCID
bottom of page