ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
http://hdl.handle.net/2117/3092
Thu, 16 Nov 2017 06:58:01 GMT2017-11-16T06:58:01ZDos problemas
http://hdl.handle.net/2117/110696
Dos problemas
Gabarró Vallès, Joaquim
Wed, 15 Nov 2017 15:48:00 GMThttp://hdl.handle.net/2117/1106962017-11-15T15:48:00ZGabarró Vallès, JoaquimAbout log-on languages : preliminary version
http://hdl.handle.net/2117/110688
About log-on languages : preliminary version
Cases Muñoz, Rafael; Gabarró Vallès, Joaquim
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 (log n) We give an explicit definition of L. The main theorem uses minimisation techniques of deterministic finite automata.
Wed, 15 Nov 2017 15:06:56 GMThttp://hdl.handle.net/2117/1106882017-11-15T15:06:56ZCases Muñoz, RafaelGabarró Vallès, JoaquimWe 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 (log n) We give an explicit definition of L. The main theorem uses minimisation techniques of deterministic finite automata.Uniform characterizations of non-uniform complexity measures
http://hdl.handle.net/2117/110675
Uniform characterizations of non-uniform complexity measures
Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim
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 a dual class and state some of its properties.
Wed, 15 Nov 2017 12:09:44 GMThttp://hdl.handle.net/2117/1106752017-11-15T12:09:44ZBalcázar Navarro, José LuisDíaz Cort, JosepGabarró Vallès, JoaquimThe 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 a dual class and state some of its properties.Keeping control transfer instructions out of the pipeline in architectures without condition codes
http://hdl.handle.net/2117/110641
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
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 for architectures without condition codes.
This work was funded by the Ministry of Education CAICYT under contract Number 314-85
Wed, 15 Nov 2017 08:59:52 GMThttp://hdl.handle.net/2117/1106412017-11-15T08:59:52ZCortadella Fortuny, JordiLlaberia Griñó, José M.González Colás, Antonio MaríaThe 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 for architectures without condition codes.On unification over unrestricted pairs of trees
http://hdl.handle.net/2117/110572
On unification over unrestricted pairs of trees
Cases Muñoz, Rafel; Díaz Cort, Josep
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 are not unifiable. When considering unrestricted pairs of binary trees, drawn from a uniform distribution, the average time to process unification is constant.
Tue, 14 Nov 2017 14:17:31 GMThttp://hdl.handle.net/2117/1105722017-11-14T14:17:31ZCases Muñoz, RafelDíaz Cort, JosepIn 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 are not unifiable. When considering unrestricted pairs of binary trees, drawn from a uniform distribution, the average time to process unification is constant.On the average size of the intersection of binary trees
http://hdl.handle.net/2117/110571
On the average size of the intersection of binary trees
Baeza Yates, Ricardo; Cases Muñoz, Rafel; Diaz Cort, Josep; Martínez Parra, Conrado
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 integral equations. In this work this analysis is carried out for the computation of the average size of the intersection of two binary trees. The development of this analysis involves Bessel functions that appear in the solutions of partial differential equations, and the result has an average size of $O(n^{2\sqrt 2 - 2} /\sqrt {\log n} )$, contrasting with the size $O(1)$ obtained when considering a uniform distribution.
Tue, 14 Nov 2017 14:06:58 GMThttp://hdl.handle.net/2117/1105712017-11-14T14:06:58ZBaeza Yates, RicardoCases Muñoz, RafelDiaz Cort, JosepMartínez Parra, ConradoThe 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 integral equations. In this work this analysis is carried out for the computation of the average size of the intersection of two binary trees. The development of this analysis involves Bessel functions that appear in the solutions of partial differential equations, and the result has an average size of $O(n^{2\sqrt 2 - 2} /\sqrt {\log n} )$, contrasting with the size $O(1)$ obtained when considering a uniform distribution.Parallel complexity of partially commutative monoids
http://hdl.handle.net/2117/110569
Parallel complexity of partially commutative monoids
Álvarez Faura, M. del Carme; Gabarró Vallès, Joaquim
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 solved in constant time by circuits of unbounded fan-in with gates
Tue, 14 Nov 2017 13:28:38 GMThttp://hdl.handle.net/2117/1105692017-11-14T13:28:38ZÁlvarez Faura, M. del CarmeGabarró Vallès, JoaquimWe 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 solved in constant time by circuits of unbounded fan-in with gatesThe Hanoi's lectures
http://hdl.handle.net/2117/110567
The Hanoi's lectures
Díaz Cort, Josep
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 part of a book on Complexity theory, which will be published by this author together with J. Balcázar and K. Gabarró. They both have a non-negligible contribution on this set of notes.
I express my gratitud to the people at the Institute of Computer Science and Cybernetics, specially to its director Phan Dinh Dieu, for the invitation and the attentions they had with me while I was there.
Tue, 14 Nov 2017 13:07:30 GMThttp://hdl.handle.net/2117/1105672017-11-14T13:07:30ZDíaz Cort, JosepThis 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 part of a book on Complexity theory, which will be published by this author together with J. Balcázar and K. Gabarró. They both have a non-negligible contribution on this set of notes.
I express my gratitud to the people at the Institute of Computer Science and Cybernetics, specially to its director Phan Dinh Dieu, for the invitation and the attentions they had with me while I was there.Génesis y evolución de la informática teórica
http://hdl.handle.net/2117/110550
Génesis y evolución de la informática teórica
Díaz Cort, Josep
Tue, 14 Nov 2017 10:48:46 GMThttp://hdl.handle.net/2117/1105502017-11-14T10:48:46ZDíaz Cort, JosepAn equational approach to concurrency
http://hdl.handle.net/2117/110449
An equational approach to concurrency
Orejas Valdés, Fernando
In this paper, we describe how can we use equations to specify the behavour of concurrent processes.
Mon, 13 Nov 2017 09:08:38 GMThttp://hdl.handle.net/2117/1104492017-11-13T09:08:38ZOrejas Valdés, FernandoIn this paper, we describe how can we use equations to specify the behavour of concurrent processes.