The Decidability of the Equivalence Problem for DOL-Systems
暂无分享,去创建一个
[1] A. Lindenmayer. Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.
[2] Peter Johansen,et al. Free Groups in Lindenmayer Systems , 1974, L Systems.
[3] Karel Culik. On the Decidability of the Sequence Equivalence Problem for D0L-Systems , 1976, Theor. Comput. Sci..
[4] L. Mirsky,et al. The Theory of Matrices , 1961, The Mathematical Gazette.
[5] The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets , 1976, ICALP.
[6] Juhani Karhumäki. The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences , 1977, RAIRO Theor. Informatics Appl..
[7] Arto Salomaa,et al. Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems , 1973, Inf. Control..
[8] Mogens Nielsen,et al. On the Decidability of Some Equivalence Problems for D0L-Systems , 1973, Inf. Control..