L Systems
暂无分享,去创建一个
[1] Tero Harju. A Polynomial Recognition Algorithm for the EDTOL Languages , 1977, J. Inf. Process. Cybern..
[2] Youichi Kobuchi,et al. Interaction Strength of DIL Systems , 1992 .
[3] Keijo Ruohonen. The Decidability of the F0L-D0L Equivalence Problem , 1979, Inf. Process. Lett..
[4] Arto Salomaa. Solution of a decision problem concerning unary Lindenmayer systems , 1974, Discret. Math..
[5] L. M. Milne-Thomson,et al. The Calculus Of Finite Differences , 1934 .
[6] Przemyslaw Prusinkiewicz,et al. The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.
[7] Jan van Leeuwen,et al. The Membership Question for ET0L-Languages is Polynomially Complete , 1975, Inf. Process. Lett..
[8] Przemyslaw Prusinkiewicz,et al. Subapical Bracketed L-Systems , 1994, TAGT.
[9] Juha Honkala. A Decision Method for The Recognizability of Sets Defined by Number Systems , 1986, RAIRO Theor. Informatics Appl..
[10] G. Rozenberg,et al. Developmental Systems with Fragmentation , 1974 .
[11] Juha Honkala. A Decision Method for the Unambiguity of Sets Defined by Number Systems , 1995, J. Univers. Comput. Sci..
[12] Andrzej Ehrenfeucht,et al. On a Bound for the D0L Sequence Equivalence Problem , 1980, Theor. Comput. Sci..
[13] Valtteri Niemi. A normal form for structurally equivalent E0L grammars , 1992 .
[14] Sheng Yu,et al. Decidability of Structural Equivalence of E0L Grammars , 1991, Theor. Comput. Sci..
[15] Grzegorz Rozenberg,et al. Cornerstones of undecidability , 1994, Prentice Hall International Series in Computer Science.
[16] Grzegorz Rozenberg. T0L Systems and Languages , 1973, Inf. Control..
[17] Takashi Yokomori. Graph-Controlled Systems — An Extension of OL systems , 1986 .
[18] Gheorghe Paun,et al. On the Union of 0L Languages , 1993, Inf. Process. Lett..
[19] Arto Salomaa. Jewels of formal language theory , 1981 .
[20] Juha Honkala. On unambiguous number systems with a prime power base , 1992 .
[21] Henning Fernau,et al. Adult Languages of Propagating Systems with Restricted Parallelism , 1993, J. Inf. Process. Cybern..
[22] Derick Wood,et al. L Codes and Number Systems , 1983, Theor. Comput. Sci..
[23] Gheorghe Paun,et al. Language-theoretic problems arising from Richelieu cryptosystems , 1993, Theor. Comput. Sci..
[24] Barbara Lando. Periodicity and Ultimate Periodicity of D0L Systems , 1991, Theor. Comput. Sci..
[25] Michael H. Albert,et al. A Proof of Ehrenfeucht's Conjecture , 1985, Theor. Comput. Sci..
[26] Keijo Ruohonen. The Decidability of the D0L-DT0L Equivalence Problem , 1981, J. Comput. Syst. Sci..
[27] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.
[28] Arto Salomaa,et al. Slender 0L Languages , 1996, Theor. Comput. Sci..
[29] Juha Honkala,et al. It is decidable whether or not a permutation-free morphism is an l code , 1987 .
[30] Warren D. Smith. DNA computers in vitro and vivo , 1995, DNA Based Computers.
[31] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[32] Arto Salomaa,et al. Ambiguity and Decision Problems Concerning Number Systems , 1983, Inf. Control..
[33] John Harrison,et al. Morphic Congruences and D0L Languages , 1994, Theor. Comput. Sci..
[34] Grzegorz Rozenberg,et al. When L was Young , 1986 .
[35] Karel Culik,et al. Systems of equations over a free monoid and Ehrenfeucht's conjecture , 1983, Discret. Math..
[36] Juhani Karhumäki,et al. An Example of a PD2L-System with the Growth Type 2½ , 1973, Information Processing Letters.
[37] Grzegorz Rozenberg,et al. The Book of L , 1986, Springer Berlin Heidelberg.
[38] Aristid Lindenmayer,et al. Models for multicellular development: Characterization, inference and complexity of L-systems , 1986, IMYCS.
[39] Gheorghe Paun,et al. On Parallel Deletions Applied to a Word , 1995, RAIRO Theor. Informatics Appl..
[40] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[41] Christian Choffrut. Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case , 1990, ICALP.
[42] A. Salomaa. On exponential growth in Lindenmayer systems , 1973 .
[43] Juha Honkala. On number systems with negative digits , 1989 .
[44] John Harrison. Dynamical Properties of PWD0L Systems , 1995, Theor. Comput. Sci..
[45] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .
[46] Masayuki Okamoto,et al. Characterization of the Structure-Generating Functions of Regular Sets and the DOL Growth Functions , 1978, Inf. Control..
[47] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[48] Jürgen Dassow,et al. On Compound Lindenmayer Systems , 1986 .
[49] Arto Salomaa. Simple Reductions Between D0L Language and Sequence Equivalence Problems , 1993, Discret. Appl. Math..
[50] Matti Soittola,et al. Positive Rational Sequences , 1976, Theor. Comput. Sci..
[51] A. Lindenmayer. Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.
[52] Gabor T. Herman,et al. Context free languages in biological systems , 1974 .
[53] A. Lindenmayer,et al. Developmental algorithms for multicellular organisms: a survey of L-systems. , 1975, Journal of theoretical biology.
[54] Leonard M. Adleman,et al. On constructing a molecular computer , 1995, DNA Based Computers.
[55] Juha Honkala. Unique representation in number systems and L codes , 1982, Discret. Appl. Math..
[56] G. Herman. Computing ability of a developmental model for filamentous organisms. , 1969, Journal of theoretical biology.
[57] Andrzej Ehrenfeucht,et al. The equality of EOL languages and codings of ol languages , 1974 .
[58] Karel Culik,et al. The Decidability of the Equivalence Problem for DOL-Systems , 1977, Inf. Control..
[59] G. Herman. I. General description and the problem of universal computing ability , 1971 .
[60] Werner Kuich. Lindenmayer Systems Generalized to Formal Power Series and Their Growth Functions , 1993, Developments in Language Theory.
[61] Juha Honkala. Bases and Ambiguity of Number Systems , 1984, Theor. Comput. Sci..
[62] P. Vitányi. Structure of growth in Lindenmayer systems , 1973 .
[63] Arto Salomaa,et al. Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems , 1973, Inf. Control..
[64] Matti Linna. The D0L-ness for Context-Free Languages is Decidable , 1976, Inf. Process. Lett..
[65] Taishin Y. Nishida. Quasi-Deterministic 0L Systems , 1992, ICALP.
[66] Arto Salomaa,et al. On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..
[67] Juha Honkala,et al. Characterization results about L codes , 1992, RAIRO Theor. Informatics Appl..
[68] Gheorghe Paun,et al. Decision Problems Concerning the Thinness of DOL Languages , 1992, Bull. EATCS.
[69] Derick Wood,et al. Simplifications of E0L Grammars , 1992 .
[70] Jürgen Dassow. Eine neue Funktion für Lindenmayer-Systeme , 1976, J. Inf. Process. Cybern..
[71] Takashi Yokomori. Inductive Inference of 0L Languages , 1992 .
[72] Umberto Eco,et al. Theory of Codes , 1976 .
[73] Andrzej Ehrenfeucht,et al. Simplifications of Homomorphisms , 1978, Inf. Control..
[74] Mogens Nielsen,et al. On the Decidability of Some Equivalence Problems for D0L-Systems , 1973, Inf. Control..
[75] Juhani Karhumäki. Two Theorems Concerning Recognizable N-Subsets of sigma* , 1976, Theor. Comput. Sci..
[76] Sven Skyum,et al. Complexity of Some Problems Concerning L Systems , 1977, ICALP.
[77] Lila Kari,et al. Power of Controlled Insertion and Deletion , 1994, Results and Trends in Theoretical Computer Science.
[78] Juha Honkala. On D0L Systems with Immigration , 1993, Theor. Comput. Sci..
[79] Derick Wood,et al. Bounded Delay L Codes , 1991, Theor. Comput. Sci..
[80] G. Thierrin,et al. DOL Schemes and Recurrent Words , 1986 .
[81] Tom Head,et al. Splicing Schemes and DNA , 1992 .
[82] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[83] J. Berstel,et al. Sur les pôles et le quotient de Hadamard de séries N-rationnelles , 1971 .
[84] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[85] Keijo Ruohonen. Zeros of Z -Rational Functions and D0L Equivalence , 1976, Theor. Comput. Sci..
[86] Sven Skyum,et al. Nonterminals, Homomorphisms, and Codings in Different Variations of 0L-Systems , 1974 .
[87] A. Lindenmayer. Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.
[88] A. Lindenmayer,et al. Grammars of Development: Discrete-State Models for Growth, Differentiation, and Gene Expression in Modular Organisms , 1992 .
[89] Andrzej Ehrenfeucht,et al. Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem , 1978, Theor. Comput. Sci..
[90] Juha Honkala. Regularity Properties of L Ambiguities of Morphisms , 1992 .
[91] Klaus-Jörn Lange,et al. The Complexity of the Emptiness Problem for EOL Systems , 1992 .
[92] Derick Wood,et al. Complexity of E0L Structural Equivalence , 1994, RAIRO Theor. Informatics Appl..