نتایج جستجو برای: 1 cells equivalence

تعداد نتایج: 3807281  

Journal: :Inf. Comput. 1999
Mariangiola Dezani-Ciancaglini Jerzy Tiuryn Pawel Urzyczyn

The main result of the paper is a constructive proof of the following equivalence: two pure -terms are observationally equivalent in the lazy concurrent -calculus i they have the same L evy-Longo trees. An algorithmwhich allows to build a context discriminating any two pure -terms with di erent L evy-Longo trees is described. It follows that contextual equivalence coincides with behavioural equ...

A.R. Forough , M. Nadjafikhah ,

Abstract : Let be a 2nd order ODE. By Cartan equivalence method, we will study the local equivalence problem under the transformations group of time-fixed coordinates. We are going to solve this problem by an applicable method which has been recognized by R. Gardner, and classify them.   

Journal: :Math. Log. Q. 2012
Ekaterina B. Fokina Sy-David Friedman

We study the structure of Σ1 equivalence relations on hyperarithmetical subsets of ω under reducibilities given by hyperarithmetical or computable functions, called h-reducibility and FF-reducibility, respectively. We show that the structure is rich even when one fixes the number of properly Σ1 (i.e. Σ 1 1 but not ∆ 1 1) equivalence classes. We also show the existence of incomparable Σ1 equival...

2009
Masahiro Fujita Dhiraj K. Pradhan Ian G. Harris

Owing to the advances in semiconductor technology, a large and complex system that has a wide variety of functionalities has been integrated on a single chip. It is called system-on-a-chip (SoC) or system LSI, since all of the components in an electronics system are built on a single chip. Designs of SoCs are highly complicated and require many manpower-consuming processes. As a result, it has ...

2012
Marco Almeida Nelma Moreira Rogério Reis

The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski’s notion of derivative, Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic fini...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1990
G P Keleher G S Stent

The o and p blast cell bandlets of the leech Theromyzon rude, which normally produce two different sets of identifiable cells designated the "O" and "P" fates, respectively, form an equivalence group: in embryos experimentally deprived of their p bandlet, the blast cells of the adjacent o bandlet may "transfate" and take on the P fate. Loss of the p bandlet is not, however, a sufficient conditi...

Journal: :Ann. Pure Appl. Logic 2011
Douglas A. Cenzer Valentina S. Harizanov Jeffrey B. Remmel

We study computability theoretic properties of 01 and 0 1 equivalence structures and how they di er from computable equivalence structures or equivalence structures that belong to the Ershov di erence hierarchy. This includes the complexity of isomorphisms between 01 equivalence structures and between 01 equivalence structures. Any 0 1 equivalence structure A with in nitely many in nite equival...

Journal: :تحقیقات اقتصادی 0
حمید زمان زاده کارشناس ارشد پژوهشکدة پولی و بانکی بانک مرکزی اصغر شاهمرادی اقتصاددان صندوق بین الملل پول

in welfare economic studies, because of the differences among households scale, we cannot consider household expenditures without attention to this factor. a simple method to consider household scale in welfare analysis is the usage of the per capita expenditure. but, the usage of per capita expenditure ignores economies of scale. in fact, per capita expenditure is a biased variable, and underv...

Journal: :Journal of Combinatorial Theory, Series A 2018

Journal: :iranian journal of fuzzy systems 2010
s ngcibi v murali b. b makamba

in this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. after obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. the number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. by exploiting the order, we label the s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید