Abstract
In this note we solve a problem left open in [2]: namely, we show that the iterated superposition of a regular language is regular. The proof of this result is based on two facts: (i) the iterated superposition of a language equals the restricted iterated superposition of the same language, (ii) the sequence formed by iteratively applying the restricted superposition can be precisely defined. We then define the restricted superposition distance between a word and a language and prove that this distance can be computed in time \({\mathcal O}(n^2f(n))\), where the language is accepted in time \({\mathcal O}(f(n))\) in the RAM model. Finally, we briefly discuss the necessity of the n 2 factor for the classes of regular and context-free languages.
Work partially supported by the PN II projects 11052(GlobalComp) and 11056(CellSim).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bottoni, P., Mauri, G., Mussio, P., Păun, G.: Grammars working on layered strings. Acta Cybernetica 13, 339–358 (1998)
Bottoni, P., Labella, A., Manca, V., Mitrana, V.: Superposition based on Watson-Crick-like complementarity. Theory of Computing Systems 39, 503–524 (2006)
Freund, R., Păun, G., Rozenberg, G., Salomaa, A.: Bidirectional sticker systems. In: Altman, R.B., Dunker, A.K., Hunter, L., Klein, T.E. (eds.) Third Annual Pacific Conf. on Biocomputing, Hawaii, pp. 535–546. World Scientific, Singapore (1998)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338–355 (1984)
Kari, L., Păun, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems, and universality. Acta Informatica 35(5), 401–420 (1998)
Kari, L., Rozenberg, G.: The many facets of Natural Computing. Communications of the ACM 51(10), 72–83 (2008)
Kobayashi, S., Mitrana, V., Păun, G., Rozenberg, G.: Formal properties of PA-matching. Theoretical Comput. Sci. 262(1-2), 117–131 (2001)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998); Tokyo, 1999
Păun, G., Rozenberg, G.: Sticker systems. Theoret. Comput. Sci. 204, 183–203 (1998)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manea, F., Mitrana, V., Sempere, J.M. (2009). Some Remarks on Superposition Based on Watson-Crick-Like Complementarity. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)