Abstract
In this paper, we define θ—bordered infinite word and unbordered words and study their properties. We give a characterization of \( \theta \)—bordered infinite words for an antimorphic involution θ. We show that the limit language of the set of all θ—bordered words is a ω—regular language for an antimorphic involution θ.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Kari, L., Mahalingam, K.: Involutively bordered words. International Journal of Foundations of Computer Science. 18, 1089–1106 (2007).
Kari, L., Mahalingam, K.: Watson Crick bordered words and their syntactic monoid. International Journal of Foundations of Computer Science. 19(5) (2008) 1163 – 1179 (2008).
Jonoska, N.: Computing with Biomolecules: Trends and Challenges. XVI Tarragona Seminar on Formal Syntax and Semantics. 27 (2003).
Adleman, L.M.: Computing with DNA. Scientific American (1998).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer India
About this paper
Cite this paper
Annal Deva Priya Darshini, C., Rajkumar Dare, V. (2013). Bordered Infinite Words. In: Bansal, J., Singh, P., Deep, K., Pant, M., Nagar, A. (eds) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012). Advances in Intelligent Systems and Computing, vol 202. Springer, India. https://doi.org/10.1007/978-81-322-1041-2_31
Download citation
DOI: https://doi.org/10.1007/978-81-322-1041-2_31
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-1040-5
Online ISBN: 978-81-322-1041-2
eBook Packages: EngineeringEngineering (R0)