Neutral and tree sets of arbitrary characteristic
type: Item
instance of: scholarly article
title: Neutral and tree sets of arbitrary characteristic
zbMATH Open document ID: 1355.68214
author: Francesco Dolce
author: Dominique Perrin
published in: Theoretical Computer Science
publication date: 2016-12-19T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6666074
zbMATH Keywords: neutral sets
zbMATH Keywords: tree sets
zbMATH Keywords: bifix codes
zbMATH Keywords: interval exchanges
zbMATH Keywords: linear involutions
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.01.008
OpenAlex ID: W2291639446
cites work: Sequences with constant number of return words
cites work: Bifix codes and Sturmian words
cites work: Q3653240
cites work: Acyclic, connected and tree sets
cites work: Bifix codes and interval exchanges
cites work: The finite index basis property
cites work: Maximal bifix decoding
cites work: Specular Sets
cites work: Return words of linear involutions and fundamental groups
cites work: Q3559177
cites work: Palindromic complexity of codings of rotations
cites work: Complexity and special factors
cites work: Enumeration Formulæ in Neutral Sets
cites work: Return words in Sturmian and episturmian words
cites work: Interval exchange transformations
cites work: Orbit structure of interval exchange transformations with flip
cites work: Q3077329
DOI: 10.1016/J.TCS.2016.01.008
description: scientific article; zbMATH DE number 6666074