On the Decidability of Some Equivalence Problems for D0L-Systems

Abstract

One of the questions of the longest open standing in the area of Lindenmayer systems is the decidability of the equivalence problem for deterministic, informationless L-systems (DOL-systems). This and some related equivalence problems (equivalence with respect to the set and the sequence of generated words, Parikh-vectors and word-lengths) are investigated… (More)
DOI: 10.1016/S0019-9958(74)90857-2

Topics

  • Presentations referencing similar topics