Suffix-connected languages

DOI10.1016/j.tcs.2022.05.001OpenAlexW3169484896MaRDI QIDQ2672617

Herman Goulet-Ouellet

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

return wordsfree groupsRauzy graphstree setsextension graphsStallings algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On Substitutions Preserving Their Return Sets

Uses Software

• SageMath
• Grout

Cites Work

• Unnamed Item
• A geometric interpretation of the Schützenberger group of a minimal subshift
• Substitutions in dynamics, arithmetics and combinatorics
• Neutral and tree sets of arbitrary characteristic
• A characterization of substitutive sequences using return words
• Stallings foldings and subgroups of free groups
• Acyclic, connected and tree sets
• Specular sets
• Computations for symbolic substitutions
• Fundamental groups,inverse schützenberger automata,and monoid presentations
• Eventually dendric shift spaces

This page was built for publication: Suffix-connected languages