arXiv (All)
open access
Maximizing entropy for power-free languages
A power-free language is characterized by the number of symbols used and a limit on how many times a block of symbols can repeat consecutively. For certain values of these parameters, it is known that the number of legal words grows exponentially fast with respect to length. In the terminology of dy
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Karel Lambert, Free Logics: Their Foundations, Character, and Some Applications Thereof (Prophil Projekte zur Philosophie Bd. 1. Eine Schriftenreihe des Forschungsinstituts Philosophie/Technik/Wirtschaft an der Universität Salzburg). Sankt Augustin: Academia-Verlag, 1997. 156 pp. Asch. 239. ISBN 3-89665-000-9#747755
- Lógica, lenguajes formales y modalidad#118798
- PRISM: Priming Relationships in Syntax and Mathematics#291095
- Fundamentals of Language#341506
- Introduction: Legal theory as media theory#1177860
Record · ID 997440
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive