Complexity and modeling power of insertion-deletion systems 

    Krassovitskiy, Alexander (Date of defense: 2011-09-02)

    SISTEMAS DE INSERCIÓN Y BORRADO: COMPLEJIDAD Y CAPACIDAD DE MODELADO El objetivo central de la tesis es el estudio de los sistemas de inserción y borrado y su capacidad computacional. Más concretamente, estudiamos algunos ...

    Contributions of formal language theory to the study of dialogues 

    Grando, Maria Adela (Date of defense: 2009-10-02)

    For more than 30 years, the problem of providing a formal framework for modeling dialogues has been a topic of great interest for the scientific areas of Linguistics, Philosophy, Cognitive Science, Formal Languages, ...

    Finite Models of Splicing and Their Complexity 

    Loos, Remco (Date of defense: 2008-02-14)

    Durante las dos últimas décadas ha surgido una colaboración estrecha entre informáticos, bioquímicos y biólogos moleculares, que ha dado lugar a la investigación en un área conocida como la computación biomolecular. El ...

    Language learning with correction queries 

    Tirnauca, Cristina (Date of defense: 2009-01-09)

    In the field of grammatical inference, the goal of any learning algorithm is to identify a target concept from a given class by having access to a specific type of information. The main learning settings are Gold's model ...

    Languages Generated by Iterated Idempotencies. 

    Leupold, Klaus-Peter (Date of defense: 2006-11-22)

    The rewrite relation with parameters m and n and with the possible length limit = k or :::; k we denote by w~, =kW~· or ::;kw~ respectively. The idempotency languages generated from a starting word w by the respective ...

    Membrane computing: traces, neural inspired models, controls 

    Ionescu, Armand-Mihai (Date of defense: 2008-04-11)

    Membrane Computing:<br/>Traces, Neural Inspired Models, Controls<br/>Autor: <br/>Armand-Mihai Ionescu<br/>Directores: <br/>Dr. Victor Mitrana <br/>(URV)<br/>Dr. Takashi Yokomori <br/>(Universidad Waseda, Japón)<br/>Resumen ...

    Petri net controlled grammars 

    Turaev, Sherzod (Date of defense: 2010-02-18)

    Different types of regulated grammars have been introduced in order to supplement shortcomings of context-free grammars in applications preserving their elegant mathematical properties. However, the rapid developments in ...

    Picture languages generated by splicing and assembling til·les 

    Sagaya Mary, Anthonath Roslin (Date of defense: 2016-02-01)

    Idiomes imatge generats per Empalme i Muntatge Rajoles. L'extensió de l'estudi de les llengües oficials sobre el cas string 2 idiomes dimensionals o idiomes imatge ha estat d'interès per molt temps per les seves vastes ...

    Repetitive subwords 

    Fazekas, Szilard Zsolt (Date of defense: 2010-02-12)

    The central notionof thisthesisis repetitionsin words. We studyproblemsrelated to contiguous repetitions. More speci&#64257;cally we will consider repeating scattered subwords of non-primitive words, i.e. words which are ...

    Rough approximations in varieties of regular languages 

    Martin Torres, Gabriela Susana (Date of defense: 2016-02-01)

    En aquest treball s'estudien aproximacions de llenguatges regulars per membres d'una varietat de llenguatges regulars donada. Es tracta d'aproximacions superiors o inferiors en el sentit de la teoria dels conjunts aproximats ...

    Syntax-directed translations, tree transformations and bimorphisms 

    Tirnauca, Catalin Ionut (Date of defense: 2016-02-01)

    La traducció basada en la sintaxi va sorgir en l'àmbit de la traducció automàtica dels llenguatges naturals. Els sistemes han de modelar les transformacions d'arbres, reordenar parts d'oracions, ser simètrics i posseir ...