Calcul de la distance par les sous-mots
Page 1 Next
Displaying 1 – 20 of 180
Calcul du centralisateur d'un groupe de permutations
Max Fontet (1977)
Mémoires de la Société Mathématique de France
Calculation des valeurs numcute{e}riques des polynomes au moyen des spectres mathematiques
K. Orlov (1974)
Matematički Vesnik
Calculi of net structures and sets are similar
Ludwik Czaja (2008)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Calculi of net structures and sets are similar
Ludwik Czaja (2007)
RAIRO - Theoretical Informatics and Applications
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Calculs approchés de la borne inférieure de valeurs réparties
Bernadette Charron-Bost, Gérard Tel (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Call-by-value solvability
Luca Paolini, Simona Ronchi Della Rocca (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Call-by-value Solvability
Luca Paolini, Simona Ronchi Della Rocca (2010)
RAIRO - Theoretical Informatics and Applications
The notion of solvability in the call-by-value λ-calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical β-reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment system,...
Can Adaption Help on the Average.
G.W. Wasilkowski, H. Wozniakkowski (1984)
Numerische Mathematik
Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Can we transform logic programs into attribute grammars ?
T. Isakowitz (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Cancer cell invasion of brain tissue: guided by a prepattern?
Wurzel, Michael, Schaller, Carlo, Simon, Matthias, Deutsch, Andreas (2005)
Journal of Theoretical Medicine
Canonical decomposition of catenation of factorial languages.
Frid, A.E. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Caractérisation results about codes
J. Honkala, A. Salomaa (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Categorical abstract data type (CADT)
S. K. Lellahi (1989)
Diagrammes
Catégories et langages de dot-depth un
Denis Thérien (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Catégories lax-localement-cartésiennes et catégories localement cartésiennes : un exemple de suffisante complétude connexe de sémantiques initiales
F. Cury (1991)
Diagrammes
Categories of partial morphisms and the relation between type structures. Partial variations on a theme of Friedman and Statman
Andrea Asperti, Giuseppe Longo (1988)
Banach Center Publications
Category of extended fuzzy automata
Jiří Močkoř, Renata Smolíková (1996)
Acta Mathematica et Informatica Universitatis Ostraviensis
Category-theoretic models of linear Abadi & Plotkin logic.
Birkedal, Lars, Møgelberg, Rasmus E., Petersen, Rasmus L. (2008)
Theory and Applications of Categories [electronic only]
Currently displaying 1 – 20 of 180
Page 1 Next