Enumeration Formulæ in Neutral Sets
From MaRDI portal
Publication:3451104
DOI10.1007/978-3-319-21500-6_17zbMath1434.68384arXiv1503.06081OpenAlexW1563935202MaRDI QIDQ3451104
Francesco Dolce, Dominique Perrin
Publication date: 10 November 2015
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.06081
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Formal languages and automata (68Q45)
Related Items (4)
Specular sets ⋮ Codes and Automata in Minimal Sets ⋮ Specular Sets ⋮ Neutral and tree sets of arbitrary characteristic
Cites Work
- Palindromic complexity of codings of rotations
- Sequences with constant number of return words
- Complexity and special factors
- Bifix codes and Sturmian words
- The finite index basis property
- Bifix codes and interval exchanges
- Acyclic, connected and tree sets
- Maximal bifix decoding
- Return words in Sturmian and episturmian words
- Return words of linear involutions and fundamental groups
- Specular Sets
- Orbit structure of interval exchange transformations with flip
- Interval exchange transformations
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumeration Formulæ in Neutral Sets