Dice Question Streamline Icon: https://streamlinehq.com

Decidability and closure properties for rule-synchronized music grammar systems

Determine the decidability of standard decision problems and characterize closure properties under common language operations for n-generative rule-synchronized music grammar systems whose components are scattered context grammars without erasing rules.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper introduces n-generative rule-synchronized music grammar systems, where each component is a scattered context grammar (without erasing rules), to orchestrate multi-instrument musical compositions. Each component corresponds to an instrument, and a global synchronization set coordinates parallel rule applications.

While the paper focuses on modeling and illustrative orchestration examples, it explicitly points to foundational formal-language-theoretic questions as open problem areas, calling for the paper of decidability and closure properties for these systems.

References

Although we have described this kind of orchestration in a rather great detail, there still remain many open problem areas related to the subject of this paper. Next, we suggest five of them. (1) Investigate classical topics of formal language theory, such as decidable problems or closure properties, in terms of the systems from Section~\ref{sec:Definitions}.

Orchestration of Music by Grammar Systems (2507.15314 - Makiš et al., 21 Jul 2025) in Section Conclusion, item (1)