scientific article; zbMATH DE number 3938573

From MaRDI portal
Publication:3709901





[For the entire collection see Zbl 0559.00001.] Let G be a graph, and A(G) be a Lindenmayer automaton on G [see \textit{A. Lindenmayer}, J. Theor. Biol. 18, 280-299 (1968)]. A(G) is called cyclic if every configuration of A(G) has a predecessor. A necessary and sufficient condition is given for A(G) to be cyclic in the case where G is a tree, a path, a circuit or a regular graph of odd degree.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709901)