<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-31T13:37:27Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/11653" metadataPrefix="mods">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/11653</identifier><datestamp>2026-02-03T10:19:02Z</datestamp><setSpec>com_10630_1685</setSpec><setSpec>col_10630_38055</setSpec></header><metadata><mods:mods xmlns:doc="http://www.lyncode.com/xoai" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Ortega Toro, José Antonio</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2016-06-27T08:37:40Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2016-06-27T08:37:40Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">2016-06-27</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="uri">http://hdl.handle.net/10630/11653</mods:identifier>
   <mods:abstract>This work focuses in the formal and technical analysis of some aspects of a constructed&#xd;
language.&#xd;
As a  first part of the work, a possible coding for the language will be studied, emphasizing the&#xd;
pre x coding, for which an extension of the Hu man algorithm from binary to n-ary will be&#xd;
implemented.&#xd;
Because of that in the language we can't know a priori the frequency of use of the words, a&#xd;
study will be done and several strategies will be proposed for an open words system, analyzing&#xd;
previously the existing number of words in current natural languages.&#xd;
As a possible upgrade of the coding, we'll take also a look to the synchronization loss problem,&#xd;
as well as to its solution: the self-synchronization, a t-codes study with the number of possible&#xd;
words for the language, as well as other alternatives.&#xd;
Finally, and from a less formal approach, several applications for the language have been&#xd;
developed: A voice synthesizer, a speech recognition system and a system font for the use&#xd;
of the language in text processors. For each of these applications, the process used for its&#xd;
construction, as well as the problems encountered and still to solve in each will be detailed.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:accessCondition type="useAndReproduction">by-nc-nd</mods:accessCondition>
   <mods:subject>
      <mods:topic>Grado en Ingeniería Informática - Trabajos Fin de Grado</mods:topic>
   </mods:subject>
   <mods:subject>
      <mods:topic>Informática - Trabajos Fin de Grado</mods:topic>
   </mods:subject>
   <mods:subject>
      <mods:topic>Codificación, Teoría de la</mods:topic>
   </mods:subject>
   <mods:subject>
      <mods:topic>Voz - Reconocimiento automático</mods:topic>
   </mods:subject>
   <mods:titleInfo>
      <mods:title>Una codificación prefija para un idioma artificial</mods:title>
   </mods:titleInfo>
   <mods:genre>bachelor thesis</mods:genre>
</mods:mods>
</metadata></record></GetRecord></OAI-PMH>