Envíos recientes

  • 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
    Acceso abierto
    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
    Acceso abierto
    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 ...
  • Complements des facteurs gauches de mots infinis et ambiguité : quelques exemples 

    Autebert, Jean-Michel; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Acceso abierto
    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 ...
  • On some "non uniform" complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Acceso abierto
    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 ...
  • Dos problemas 

    Gabarró Vallès, Joaquim (1985-09)
    Report de recerca
    Acceso abierto
  • About log-on languages : preliminary version 

    Cases Muñoz, Rafael; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Acceso abierto
    We deal with on-line log-space Turing Machines with markers in the work tapes. In this type of machines we prove the existence of a language L satisfying L ϵ NSPACE_s (log⁡ n) , L ̅ ϵ NSPACE_s (log⁡ n) and L ϵ NSPACE_s ...
  • Uniform characterizations of non-uniform complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Acceso abierto
    The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ...
  • Keeping control transfer instructions out of the pipeline in architectures without condition codes 

    Cortadella Fortuny, Jordi; Llaberia Griñó, José M.; González Colás, Antonio María (1987-05)
    Report de recerca
    Acceso abierto
    The execution of branch instructions involves a loss of performance in pipelined processors. In this paper we present a mechanism for executing this kind of instruction with a zero delay. This mechanism has been proposed ...
  • On unification over unrestricted pairs of trees 

    Cases Muñoz, Rafel; Díaz Cort, Josep (1989-01)
    Report de recerca
    Acceso abierto
    In this work, we deal with the unification of unrestricted (i.e. inifiable and non-unifiable) pais of binary trees with uniform probability distribution. The following results are obtained: Almost all pairs of binary trees ...
  • On the average size of the intersection of binary trees 

    Baeza Yates, Ricardo; Cases Muñoz, Rafel; Diaz Cort, Josep; Martínez Parra, Conrado (1989-01)
    Report de recerca
    Acceso abierto
    The average-case analysis of algorithms for binary search trees yields very different results from those obtained under the uniform distribution. The analysis itself is more complex and replaces algebraic equations by ...
  • Parallel complexity of partially commutative monoids 

    Álvarez Faura, M. del Carme; Gabarró Vallès, Joaquim (1989-01)
    Report de recerca
    Acceso abierto
    We consider the parallel complexity of some problems issued from Petri nets, partially commutative monoids and finite automata. we prove the following: (19 The membership problem for firing sequances on Petri Nets can be ...
  • The Hanoi's lectures 

    Díaz Cort, Josep (1985)
    Report de recerca
    Acceso abierto
    This set of notes are the core of the lectures given at the Department of Systems theory and Optimal Control in the Institute of Computer Science and Cybernetics of Hanoi, in June of 1985. They are incomplete, and form ...

Muestra más