Metraipolis › archive › dc_1b0584685396
Classification of non-Leibnizian Strings — arXiv:2611.01625
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01625
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:46:35.867Z
- SHA-256 of the archived text
8b6546d97e5ffb2f9e3b18108661d4914865f14c1d8183a5f28a7a90f55e6c5e- Stable URL of this page
https://metraipolis.com/documento/dc_1b0584685396
How to cite
Classification of non-Leibnizian Strings — arXiv:2611.01625 — arXiv (en), https://arxiv.org/abs/2611.01625 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1b0584685396 (Metraipolis archive dc_1b0584685396, sha256 8b6546d97e5ffb2f9e3b18108661d4914865f14c1d8183a5f28a7a90f55e6c5e)
BibTeX
@misc{dc1b0584685396,
title = {Classification of non-Leibnizian Strings — arXiv:2611.01625},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01625},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1b0584685396; sha256 8b6546d97e5ffb2f9e3b18108661d4914865f14c1d8183a5f28a7a90f55e6c5e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01625. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Leibnizian ideas in foundations of physics has enjoyed a renewed interest. Cyclic string ontology in Wolfram Model multiway rewriting systems has been found to encode finite dimensional quantum systems where what are called as Leibnizian strings have been employed. It has then become important to classify strings in terms of their ability to correspond to a monadic interpretation à la Leibniz. The definition of Leibnizian strings are rather quite non-linear and for that purpose we classify non-Leibnizian strings for which there is a simpler criterion on maximal neighborhoods of characters. If a string is not non-Leibnizian then it must be Leibnizian. We found out three canonical forms of non-Leibnizian strings and noted that two of them are context-free languages whereas one is not. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.FL, nuovi lavori del giorno). Categorie arXiv: Formal Languages and Automata Theory (cs.FL). Pagina del lavoro: https://arxiv.org/abs/2611.01625 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:08:37.174Z dalla pagina https://arxiv.org/list/cs.FL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).