Language Evolution and Computation Bibliography

A formal language is called factorizable if any substring of a word in it also belongs to the language. Symbolic sequences from symbolic dynamics make factorizable languages by definition. In studying avoided and under-represented strings in bacterial genomes we have defined a factorizable language for each complete genome. Recently, in studying the problem of uniqueness of reconstruction of a protein sequence from its constituent K-peptides we encounter again factorizable language which helps to build a finite state automaton to recognize the uniqueness of reconstruction. We present a brief review of these applications of factorizable languages from dynamics to biology.