The Decidability of the D0L-DT0L Equivalence Problem
暂无分享,去创建一个
[1] Grzegorz Rozenberg,et al. The Equivalence Problem for Deterministic T0L-Systems is Undecidable , 1972, Inf. Process. Lett..
[2] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[3] Andrzej Ehrenfeucht,et al. Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem , 1978, Theor. Comput. Sci..
[4] Grzegorz Rozenberg,et al. Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable , 1972, Inf. Process. Lett..
[5] Karel Culik,et al. The Decidability of the Equivalence Problem for DOL-Systems , 1977, Inf. Control..
[6] Paul M. B. Vitányi,et al. On the Size of D0L Languages , 1974, L Systems.
[7] Mogens Nielsen,et al. On the Decidability of Some Equivalence Problems for D0L-Systems , 1973, Inf. Control..
[8] Keijo Ruohonen. The Decidability of the F0L-D0L Equivalence Problem , 1979, Inf. Process. Lett..
[9] Keijo Rouhonen. A note on language equations involving morphisms , 1978 .
[10] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.
[11] Meera Blattner. The Unsolvability of the Equality Problem for Sentential Forms of Context-Free Grammars , 1973, J. Comput. Syst. Sci..
[12] Mogens Nielsen,et al. The Growth Range Equivalence Problem for DOL Systems is Decidable , 1975, Automata, Languages, Development.
[13] Grzegorz Rozenberg. Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems , 1972, Inf. Process. Lett..
[14] Keijo Ruohonen. On the Decidability of the OL-DOL Equivalence Problem , 1979, Inf. Control..