"The Reflection Complexity of Sequences Over Finite Alphabets."

Jean-Paul Allouche et al. (2025)

> Home

Details and statistics

DOI: 10.1007/S00224-025-10234-X

access: closed

type: Journal Article

metadata version: 2025-09-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/AlloucheCLSS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/AlloucheCLSS25
Jean-Paul Allouche, John M. Campbell, Shuo Li, Jeffrey O. Shallit, Manon Stipulanti:
The Reflection Complexity of Sequences Over Finite Alphabets. Theory Comput. Syst. 69(3): 31 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.