Work

Lindenmayer graph languages, first-order theories and expanders

Year: 2024

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2405.17629

Author: Knapik, Teodor

Institutions: University of New Caledonia, Institut de sciences exactes et appliquées

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6966792123

Cites:

Cited by:

Related to: