Index Grammars, Music, and Formal Languages This series of articles explores an unusual territory: where formal language theory meets algorithmic music. The common thread is BP2SC, a transpiler that converts musical grammars from the Bol Processor into SuperCollider patterns. Each article is designed to be accessible without academic prerequisites, yet rigorous enough to serve as […]
**Grammatical inference**: the ultimate challenge. Impossible (Gold), hard as cracking RSA, it is the extreme case of recognition. Learning is compressing.
The slogan ‘generating is easy, analyzing is hard’ is false. Semantic-constrained generation can be exponential or NP-complete, even surpassing parsing.
Why is generating simpler than analyzing? Discover the formulas of generation-parsing asymmetry: complexity, Catalan numbers, and surprisal.
Generation is always top-down. Parsing (LL, LR) has a unique directional freedom. Discover this fundamental asymmetry, essential for compilers.
Index Grammars, Music and Formal Languages This article series explores unusual territory: where formal language theory meets algorithmic music. The common thread is BP2SC, a transpiler that converts musical grammars from Bol Processor into SuperCollider patterns. Each article is designed to be accessible without academic prerequisites, yet rigorous enough to serve as a reference. The […]
Comprehensive glossary of terms in language theory, compilation, and formal semantics. Clear definitions with links to explanatory articles.
**Grammatical inference**: the ultimate challenge. Impossible (Gold), as hard as breaking RSA, it is the extreme case of recognition. To learn is to compress.
The slogan ‘generating is easy, analyzing is difficult’ is false. Semantic-constrained generation can be exponential, NP-complete, and exceed parsing.
Why is generating simpler than analyzing? Discover the formulas of generation-parsing asymmetry: complexity, Catalan numbers, and surprisal.