Abstract
Let K and L be two languages over \(\Sigma \) and \(\Gamma \) (with \(\Gamma \subset \Sigma \)), respectively. Then, the L-reduction of K, denoted by \(K\%\,L\), is defined by \(\{ u_0u_1\cdots u_n \in (\Sigma - \Gamma )^* \mid u_0v_1u_1 \cdots v_nu_n \in K, \ v_i \in L \ (1\le i \le n) \}\). This is extended to language classes as follows: \({\mathcal {K}}\% {\mathcal {L}}=\{K\%L \mid K \in {\mathcal {K}}, \, L \in {\mathcal {L}} \}\). In this paper, we investigate the computing powers of \(\mathcal {K}\%\,\mathcal {L}\) in which \(\mathcal {K}\) ranges among various classes of \(\mathcal {INS}^i_{\!\!j}\) and min-\(\mathcal {LIN}\), while \(\mathcal {L}\) is taken as \(\mathcal {DYCK}\) and \(\mathcal {F}\), where \(\mathcal {INS}^i_{\!\!j}\): the class of insertion languages of weight (j, i), min-\(\mathcal {LIN}\): the class of minimal linear languages, \(\mathcal {DYCK}\): the class of Dyck languages, and \(\mathcal {F}\): the class of finite languages. The obtained results include:
-
\(\mathcal {INS}^1_1\,\%\,\mathcal {DYCK}=\mathcal {RE}\)
-
\(\mathcal {INS}^0_i\,\%\,\mathcal {F}= \mathcal {INS}^1_j\,\%\,\mathcal {F}=\mathcal {CF}\) (for \(i\ge 3\) and \(j\ge 1\))
-
\(\mathcal {INS}^0_2\,\%\,\mathcal {DYCK}=\mathcal {INS}^0_2\)
-
min-\(\mathcal {LIN}\,\%\,\mathcal {F}_1=\mathcal {LIN}\)
where \(\mathcal {RE}\), \(\mathcal {CF}\), \(\mathcal {LIN}\), \(\mathcal {F}_1\) are classes of recursively enumerable, of context-free, of linear languages, and of singleton languages over unary alphabet, respectively. Further, we provide a very simple alternative proof for the known result min-\(\mathcal {LIN}\,\%\,\mathcal {DYCK}_2=\mathcal {RE}\). We also show that with a certain condition, for the class of context-sensitive languages \(\mathcal {CS}\), there exists no \(\mathcal {K}\) such that \(\mathcal {K}\%\,\mathcal {DYCK}=\mathcal {CS}\), which is in marked contrast to the characterization results mentioned above for other classes in Chomsky hierarchy. It should be remarked from the viewpoint of molecular computing theory that the notion of L-reduction is naturally motivated by a molecular biological functioning well-known as RNA splicing occurring in most eukaryotic genes.
Similar content being viewed by others
Notes
This type of insertion systems is called pure insertion grammars [16].
This is referred to as semi-Dyck language in some literature.
This definition is somewhat different from the one in [12], while we assume the condition \(\Gamma \subset \Sigma \) for simplicity, without loss of the essential part of the argument.
Due to one of the reviewers who brought us this insightful perspective.
References
Book, R.V., Jantzen, M., Wrathall, C.: Monadic Thue systems. Theor. Comput. Sci. 19, 213–251 (1982)
Frougny, Ch., Sakarovitch, J., Schupp, P.: Finiteness conditions on subgroups and formal language theory. Proc. Lond. Math. Soc. 58, 74–88 (1989)
Fujioka, K.: Morphic characterizations of languages in Chomsky hierarchy with insertion and locality. Inf. Comput. 209, 397–408 (2011)
Fujioka, K., Katsuno, H.: On the generative power of cancel minimal linear grammars with single nonterminal symbol except the start symbol. IEICE Trans. Inf. Syst. 94(10), 1945–1954 (2011)
Geffert, V.: Normal forms for phrase-structure grammars. RAIRO Theoret. Inf. Appl. 25, 473–496 (1991)
Harrison, M.A.: Introduction to Formal Language Theory, Addison Wesley, Reading, Mass., (1978)
Hirose, S., Okawa, S.: Dyck reduction of minimal linear languages yield the full class of recursively enumerable languages. IEICE Trans. Inf. Syst. 79(2), 161–164 (1996)
Hirose, S., Okawa, S., Kimura, H.: Homomorphic characterizations are more powerful than Dyck reductions. IEICE Trans. Inf. Syst. 80(3), 390–392 (1996)
Hirose, S., Okawa, S., Yoneda, M.: On the impossibility of the homomorphic characterization of context-sensitive languages. Theor. Comput. Sci. 44, 225–228 (1986)
Ito, M., Kari, L., Thierrin, G.: Shuffle and scattered deletion closure of languages. Theor. Comput. Sci. 245(1), 115–133 (2000)
Jantzen, M., Petersen, H.: Petri net languages and one-sided Dyck\(_1\)-reductions of context-free sets. In: Voss, K., Genrich, H., Rozenberg, G. (eds.) Concurrency and Nets, pp. 245–252. Springer, Berlin (1987)
Jantzen, M., Petersen, H.: Cancellation in context-free languages: enrichment by reduction. Theor. Comput. Sci. 127, 149–170 (1994)
Jantzen, M., Kudlek, M., Lange, K.-J., Petersen, H.: Dyck\(_1\)-reductions of context-free languages. Comput. Artif. Intell. 9, 3–18 (1990)
Kari, L.: On insertion and deletion in formal languages, PhD, (1991)
Kari, L., Mateescu, A., Paun, G., Salomaa, A.: On parallel deletions applied to a word. RAIRO Theor. Inform. Appl. Inform. Théor. Appl. 29(2), 129–144 (1995)
Kari, L., Sosik, P.: On the weight of universal insertion grammars. Theor. Comput. Sci. 396, 264–270 (2008)
Kimura, T.: Formal description of communication behavior, In: Proc. Johns Hopkins Conf. on Information Sciences and Systems , 286–291 (1979)
Latteux, M., Turakainen, P.: On characterizations of recursively enumerable languages. Acta Inform. 28, 179–186 (1990)
Margenstern, M., Păun, Gh., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330, 339–348 (2005)
Okubo, F., Yokomori, T.: Morphic characterizations of language families in terms of insertion systems and star languages. Intern. J. Found. Comput. Sci. 22, 247–260 (2011)
Okubo, F., Yokomori, T.: On the computing powers of \(\cal{L}\)-reductions of insertion languages. Theor. Comput. Sci. 862, 224–235 (2021)
Onodera, K.: A note on homomorphic representation of recursively enumerable languages with insertion grammars. IPSJ J. 44(5), 1424–1427 (2003)
Păun, Gh., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer-Verlag, Berlin (1998)
Păun, Gh., P\(\acute{{\rm e}}\)rez-Jim\(\acute{{\rm e}}\)nez, M.J., Yokomori, T.: Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems, Intern J. Found. Comput. Sci. 19(4), 859–871 (2008)
Penttonen, M.: One-sided and two-sided context in formal grammars. Inf. Control 25(4), 371–392 (1974)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997)
Salomaa, A.: Formal Languages. Academic Press, Cambridge (1973)
Savitch, W.J.: Some characterizations of Lindenmayer systems in terms of Chomsky-type grammars and stack machines. Inf. Control 27, 37–60 (1975)
Savitch, W.J.: Parantheses grammars and Lindenmayer systems, In: Rozenberg, G.,Salomaa, A. (eds), The Book of L, Spriger-Verlag , 403-411 (1986)
Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210–245 (2010)
Verlan, S., Fernau, H., Kuppusamy, L.: Universal insertion grammars of size two. Theor. Comput. Sci. 843, 153–163 (2020)
Acknowledgements
The authors are grateful to the anonymous referees for their careful reading and valuable comments which improved this paper considerably. The work of F. Okubo was in part supported by JSPS KAKENHI, Grant Number JP16K16008.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fujioka, K., Okubo, F. & Yokomori, T. \(\mathcal {L}\)-reduction computation revisited. Acta Informatica 59, 409–426 (2022). https://doi.org/10.1007/s00236-022-00418-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-022-00418-0