✦ LIBER ✦

Arithmetical complexity of symmetric D0L words

✍ Scribed by A.E. Frid

No coin nor oath required. For personal study only.

✦ Synopsis

We characterize and count words which occur in arithmetical subsequences of ÿxed points of symmetric morphisms.

📜 SIMILAR VOLUMES

On the computational complexity of infin

✍ Pavol Ďuriš; Ján Maňuch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Negation-limited circuit complexity of s

✍ Keisuke Tanaka; Tetsuro Nishino; Robert Beals 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 710 KB

The complexity of colouring symmetric re

✍ Richard Brewster 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 752 KB

Real congruences of complex subspaces of

✍ William C. Waterhouse 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 71 KB

The complexity of the word problem for a

✍ Volker Weispfenning 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 365 KB

The complexity of computing symmetric fu

✍ Paul Beame; Erik Brisson; Richard Ladner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 811 KB