2024/05/27 by Knapik, Teodor
#03D05 (Primary) 68Q42 #05C48 #92C15 (Secondary) #F.4.1 #F.4.2 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Logic (math.LO)
paper · doi:10.48550/arxiv.2405.17629
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.