Reports de recerca

Enviaments recents

  • Automatic evaluation of top-down predictive parsing 

    Creus, Carles; Fernández Durán, Pau; Godoy, Guillem; Mamano, Nil (2016-04-01)
    Report de recerca
    Accés obert
    We develop efficient methods to check whether two given Context-Free Grammars (CFGs) are transformed into parsers that recognize the same language and construct the same Abstract Syntax Trees (ASTs) for each input. In this ...

  • Network creation games: structure vs anarchy 

    Álvarez Faura, M. del Carme; Messegué Buisan, Arnau (2017-09-03)
    Report de recerca
    Accés obert
    We study Nash equilibria and the price of anarchy in the classical model of Network Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at a prefixed price a > 0 in order to get connected ...

  • Distributed ambient graphs with business configurations 

    Mylonakis Pascual, Nicolás (2018-01-17)
    Report de recerca
    Accés obert
    In this paper we present distributed ambient graphs with business configurations to extend our original model of service oriented computing ($SOC$) with an ambient topology of locations. This ambient topology is based on ...

  • Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1984)
    Report de recerca
    Accés obert
    We find sets in the class LOGSPACE (on-line) that do not have good respectively approximations by context-free languages. For that we introduce the languages CF-bi-inmune and CF-levelable. We prove the results by defining ...

  • Connections among non uniform models for problems requiring high amount of resources 

    Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (1985-11)
    Report de recerca
    Accés obert
    We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined ...

  • Manual de POSTOFF : nueva versión 

    Balcázar Navarro, José Luis (1985)
    Report de recerca
    Accés obert
    Un programa adaptador de textos para que el formateador DSR Runoff se haga amiguete de la impresora LA100. Documentación correspondiente a la versión 3.0. Creado por José Luis Balcázar en la F.I.B. durante 1984.

  • Complements des facteurs gauches de mots infinis et ambiguité : quelques exemples 

    Autebert, Jean-Michel; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    On se propose d'utiliser la méthode que P. Flajolet a décrit pour prouver l'ambiguité du langage de Goldstine [5], afin de prouver l'ambiguité d'une série de langages du même type. Ces langages sont tous des complémentaires ...

  • Lenguajes de representación del conocimiento basados en frames: estudio comparativo 

    Abad Soriano, María Teresa; Armengol Voltas, Eva; Blanco, Miguel Ángel; Castell Ariño, Núria; Delgado, Lourdes; Garijo, Francisco J.; González, Juan; Martí Antonin, Maria Antònia; Ribas Framis, Francesc; Rodríguez Hontoria, Horacio; Urretavizcaya, Maite; Verdejo Maillo, Maria Felisa; Vila Grabulosa, Lluís (1987)
    Report de recerca
    Accés obert
    Este documento es el resultado del seminario de trabajo del grupo G.U.I.A. sobre herramientas de representación del conocimiento llevado a cabo desde Octubre del 86 a Junio del 87. El objetivo principal es establecer una ...

  • ALIS + MILORD 

    López de Mántaras, Ramon; Cortés García, Claudio Ulises; Plaza, Enric; Sierra, Carlos; Villar, Alfredo (1985)
    Report de recerca
    Accés obert
    Aquest report desenvolupa les dues vessants principals en el camp de l'enginyeria de coneixements i una metodologia per a l'adquisició de l'expertesa i el disseny i implementació de diversos motors d'interferència. La ...

  • On some "non uniform" complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several ...

  • Diameter minimization in networks for SIMD machines 

    Beivide Palacio, Ramon; Balcázar Navarro, José Luis (1985)
    Report de recerca
    Accés obert
    We propose an algebraic constructive method which allows to find a certain kind of networks having optimal diameter. These interconnection networks have been proposed for SIMD machines. We compare the results with other ...

  • Dos problemas 

    Gabarró Vallès, Joaquim (1985-09)
    Report de recerca
    Accés obert

Mostra'n més