From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Khormali, Omid, Mtimet, Ghaya, Aydin, Nuh
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics 68Q45, 68R15, 68W40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2601.01375