Context free languages in biological systems

DOI10.1080/00207167508803098zbMath0312.68039OpenAlexW2170067810MaRDI QIDQ4070334

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

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

Related Items (11)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Closure properties of some families of languages associated with biological systems
• On 0L-Languages

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