Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 4, 1974 - Issue 1-4
Submit an article Journal homepage
23
Views
24
CrossRef citations to date
0
Altmetric
Original Articles

Context free languages in biological systems

Gabor T. Herman Department of Computer Science, State University of New York at Buffalo, 4226 Ridge Lea Road, Amherst, New York, 14226, USA
&
Adrian Walker Department of Computer Science, State University of New York at Buffalo, 4226 Ridge Lea Road, Amherst, New York, 14226, USA
Pages 369-391 | Published online: 19 Mar 2007

Citations (24)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (3)

Taishin Nishida & Youichi Kobuchi. (1983) Stability in OL systems. International Journal of Computer Mathematics 13:2, pages 105-115.
Read now
Tom Head. (1982) Expanded subalphabets in the theories of languages and semigroups† . International Journal of Computer Mathematics 12:2, pages 113-123.
Read now
G. Thierrin. (1979) Context-free and stationary languagest† . International Journal of Computer Mathematics 7:4, pages 297-301.
Read now

Articles from other publishers (21)

Pavel Martinek. (2016) On equality between fuzzy context-free and fuzzy adult 0L languages. Fuzzy Sets and Systems 301, pages 116-128.
Crossref
Jan Baedke. (2013) The epigenetic landscape in the course of time: Conrad Hal Waddington’s methodological impact on the life sciences. Studies in History and Philosophy of Science Part C: Studies in History and Philosophy of Biological and Biomedical Sciences 44:4, pages 756-773.
Crossref
F. Levé & G. Richomme. (2005) On a conjecture about finite fixed points of morphisms. Theoretical Computer Science 339:1, pages 103-128.
Crossref
Lila Kari, Grzegorz Rozenberg & Arto Salomaa. 1997. Handbook of Formal Languages. Handbook of Formal Languages 253 328 .
A. Lindenmayer & H. Jürgensen. 1992. Lindenmayer Systems. Lindenmayer Systems 3 21 .
Tom Head & Barbara Lando. 1990. Sequences. Sequences 244 253 .
Taishin Nishida & Youichi Kobuchi. (1987) Repeatable words for substitution. Theoretical Computer Science 53:2-3, pages 319-333.
Crossref
A. Lindenmayer. 1987. Trends, Techniques, and Problems in Theoretical Computer Science. Trends, Techniques, and Problems in Theoretical Computer Science 138 168 .
G. Rozenberg & A. SalomaaTom Head & Barbara Lando. 1986. The Book of L. The Book of L 147 156 .
Jacques Sakarovitch, Taishin Nishida & Youichi Kobuchi. (1984) Recurrent words for substitution. Mathematical Systems Theory 17:1, pages 199-215.
Crossref
Youichi Kobuchi. (1983) Stability of desynchronized 0L systems. Information Processing Letters 17:2, pages 85-90.
Crossref
Jürgen Dassow. (1982) Grammars with valuations — a discrete model for self-organization of biopolymers. Discrete Applied Mathematics 4:3, pages 161-174.
Crossref
Klaus-Jörn Lange. (1980) Equivalence of adult languages and extensions for DTOL systems. Information and Control 47:2, pages 107-112.
Crossref
J. Engelfriet & G. Rozenberg. (1980) Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages. Journal of the ACM 27:3, pages 499-518.
Crossref
Takashi Yokomori. (1980) Stochastic characterizations of E0L languages. Information and Control 45:1, pages 26-33.
Crossref
. 1980. 341 348 .
Grzegorz Rozenberg. 1980. Formal Language Theory. Formal Language Theory 195 239 .
Joost Engelfriet & Grzegorz Rozenberg. (1979) Equality languages and fixed point languages. Information and Control 43:1, pages 20-49.
Crossref
Joost Engelfriet & Grzegorz Rozenberg. (1978) Equality languages, fixed point languages and representations of recursively enumerable languages. Equality languages, fixed point languages and representations of recursively enumerable languages.
Paul M.B. Vitányi & Adrian Walker. (1978) Stable string languages of lindenmayer systems. Information and Control 37:2, pages 134-149.
Crossref
Gabor T. Herman & Adrian Walker. (1976) On the stability of some biological schemes with cellular interactions. Theoretical Computer Science 2:1, pages 115-130.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.