Lindenmayer graph languages, first-order theories and expanders
Formal Languages and Automata Theory
2024-05-29 v1 Logic
Abstract
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.
Cite
@article{arxiv.2405.17629,
title = {Lindenmayer graph languages, first-order theories and expanders},
author = {Teodor Knapik},
journal= {arXiv preprint arXiv:2405.17629},
year = {2024}
}