Context free languages in biological systems

DOI10.1080/00207167508803098zbMATH Open0312.68039OpenAlexW2170067810MaRDI QIDQ4070334FDOQ4070334

Authors: Gabor T. Herman, Adrian Walker 

Publication date: 1975

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167508803098

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) General biology and biomathematics (92B05) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Closure properties of some families of languages associated with biological systems
• On 0L-Languages
• Title not available (Why is that?)

Cited In (11)

• Repeatable words for substitution
• On a conjecture about finite fixed points of morphisms
• Stability in OL systems
• On the fixpoints of monogenic functions in free monoids
• Context-free and stationary languagest†
• Grammars with valuations - a discrete model for self-organization of biopolymers
• Expanded subalphabets in the theories of languages and semigroups†
• Recurrent words for substitution
• Stability of desynchronized 0L-systems
• On equality between fuzzy context-free and fuzzy adult 0L languages
• On the stability of some biological schemes with cellular interactions

This page was built for publication: Context free languages in biological systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4070334)