Observatorio de I+D+i UPM

Memorias de investigación
Research Publications in journals:
SOME REMARKS ON THE HAIRPIN COMPLETION
Year:2010
Research Areas
  • Information technology and adata processing
Information
Abstract
We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.
International
Si
JCR
Si
Title
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
ISBN
0129-0541
Impact factor JCR
0,512
Impact info
Volume
21
Journal number
5
From page
859
To page
872
Month
OCTUBRE
Ranking
Participants
  • Autor: Victor Mitrana (UPM)
Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Grupo de Computación Natural
S2i 2020 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNCIDE 2011 (OTR-2011-0236)
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)