Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences
We prove that the property of being closed (resp., palindromic, rich, privileged trapezoidal, balanced) is expressible in first-order logic for automatic (and some related) sequences. It therefore follows that the characteristic function of those n for which an automatic sequence x has a closed (res...
| Main Authors: | , |
|---|---|
| מחברים אחרים: | |
| פורמט: | Article |
| שפה: | en_US |
| יצא לאור: |
European Mathematical Information Service (EMIS)
2016
|
| גישה מקוונת: | http://hdl.handle.net/1721.1/103037 https://orcid.org/0000-0001-6823-3343 |