Lindenmayer graph languages, first-order theories and expanders
<|reference_start|>Lindenmayer graph languages, first-order theories and expanders: Combinatorial generation of expander families and Lindenmayer-style development models are both parallel in nature. Both can be handled within proposed parallel graph grammar formalism. Their first-order properties can then be checked by encompassing the generated graph language into an appropriate automatic structure.<|reference_end|>
@article{knapik2024lindenmayer,
    title={Lindenmayer graph languages, first-order theories and expanders},
    author={Teodor Knapik},
    journal={arXiv preprint arXiv:2405.17629},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.17629},
    primaryClass={cs.FL math.LO}
}