Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States
- 322 Downloads
In this article, we consider leftist insertion-deletion systems, in which all rules have contexts on the same side, and may only insert or delete one symbol at a time. We start by introducing extended rules, in which the contexts may be specified as regular expressions, instead of fixed words. We then prove that leftist systems with such extended rules and two-state graph control can simulate any arbitrary 2-tag system. Finally, we show how our construction can be simulated in its turn by graph-controlled leftist insertion-deletion systems with conventional rules of sizes (1, 1, 0; 1, 2, 0) and (1, 2, 0; 1, 1, 0) (where the first three numbers represent the maximal size of the inserted string and the maximal size of the left and right contexts respectively, while the last three numbers provide the same information about deletion rules), which implies that the latter systems are universal.
KeywordsRegular Expression Expressive Power Communication Graph State Symbol Signal Symbol
The authors would like to acknowledge the support of ANR project SynBioTIC.
- 4.Daley, M., Kari, L., Gloor, G., Siromoney, R.: Circular contextual insertions/deletions with applications to biomolecular computation. In: SPIRE/CRIWG, pp. 47–54 (1999)Google Scholar
- 5.Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion-deletion systems. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings of the Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, vol. 31 of EPTCS, pp. 88–98 (2010)Google Scholar
- 6.Galiukschov, B.: Semicontextual grammars. Matematicheskaya Logica i Matematicheskaya Lingvistika, pp. 38–50. Tallin University, Russian (1981)Google Scholar
- 7.Haussler, D.: Insertion and Iterated Insertion as Operations on Formal Languages. PhD thesis, University of Colorado at Boulder (1982)Google Scholar
- 9.Ivanov, S., Verlan, S.: On the lower bounds for leftist insertion-deletion languages. SubmittedGoogle Scholar
- 10.Ivanov, S., Verlan, S.: Random context and semi-conditional insertion-deletion systems. CoRR, abs/1112.5947 (2011)Google Scholar
- 12.Kari, L.: On insertion and deletion in formal languages. PhD thesis, University of Turku (1991)Google Scholar
- 13.Kari, L., Păun, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: characterizing RE using insertion-deletion systems. In: Proceedings of 3rd DIMACS Workshop on DNA Based Computing, pp. 318–333. Philadelphia (1997)Google Scholar
- 15.Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton, NJ (1956)Google Scholar
- 16.Krassovitskiy, A.: Complexity and Modeling Power of Insertion-Deletion Systems. PhD thesis, Departament de Filologies Romániques, Universitat Rovira and Virgili (2011)Google Scholar
- 30.Verlan, S.: Study of language-theoretic computational paradigms inspired by biology. Habilitation thesis, Université Paris Est (2010)Google Scholar