Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is nonregular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.
KeywordsLanguage operations Closure properties Regular languages
- 3.Daley, M., Kari, L., Gloor, G., Siromoney, R.: Circular contextual insertions/deletions with applications to biomolecular computation. In: String Processing and Information Retrieval Symposium, pp. 47–54 (1999)Google Scholar
- 4.Enaganti, S., Ibarra, O., Kari, L., Kopecki, S.: On the overlap assembly of strings and languages. Nat. Comput. (2016). dx.doi.org/10.1007/s11047-015-9538-x
- 5.Enaganti, S.K., Ibarra, O.H., Kari, L., Kopecki, S.: Further remarks on DNA overlap assembly, manuscript (2016)Google Scholar
- 8.Galiukschov, B.: Semicontextual grammars (in Russian). Mat. Log. Mat. Lingvistika 38–50 (1981)Google Scholar
- 12.Kari, L.: On insertion and deletion in formal languages. Ph.D. thesis, University of Turku (1991)Google Scholar