There are connections between the techniques used in this paper and the study of descriptional complexity of formal languages. The encoding of finite relations on non-negative integers can be seen as a form of descriptional complexity, where the challenge lies in representing complex structures using simple encodings. The use of efficient asymptotically good codes to represent families of subsets by directed graphs is a technique that resonates with the concept of succinct representations in descriptional complexity.
Moreover, the analysis of regular realizability problems and the construction of automata over infinite alphabets can be related to the study of succinctness and expressiveness in formal language theory. By exploring the trade-offs between the complexity of automata and the representational power of languages, researchers can gain insights into the inherent limitations and capabilities of different computational models. This can lead to advancements in understanding the complexity of formal languages and the efficiency of algorithms for language recognition and manipulation.