نتایج جستجو برای: congruence myhill nerode

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

1997
Rob J. van Glabbeek

Flat iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the rst argument to be a sum of atomic actions. It generalizes pre x iteration, in which the rst argument is a single action. Complete nite equational axiomatizations are given for ve notions of bisimulation congruence over basic CCS with at iteration, viz. strong congruence, b...

Journal: :مدیریت ورزشی 0
محمد رسول خدادادی دانشگاه پیام نور میر محمد کاشف دانشگاه ارومیه میر حسن سید عامری دانشگاه ارومیه معصومه اعلمی کشکی دانشگاه تبریز

the aim of the present research was to investigate the relationship between the components of organizational intelligence and organizational culture in physical education general office and offices in east azerbaijan province. the present research was a descriptive – correlation one and performed as a field. the statistical population consisted of the staff of physical education general office ...

1991
Ralph Freese Keith Kearnes

Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...

2001
Ulrich Furbach Harald Ganzinger Deepak Kapur

Congruence Closure and Applications Congruence closure algorithms for solving word problems for finitely pre-sented algebras have also been used in combining decision procedures. Onthe other hand, congruence closure can itself be looked upon as a combina-tion problem. Taking this view leads us to define the notion of an abstractcongruence closure. We present a completion based d...

2012
Clifford Bergman Joel Berman

A congruence relation θ on an algebra A is fully invariant if every endomorphism of A preserves θ. A congruence θ is verbal if there exists a variety V such that θ is the least congruence of A such that A/θ ∈ V. Every verbal congruence relation is known to be fully invariant. This paper investigates fully invariant congruence relations that are verbal, algebras whose fully invariant congruences...

2008
Roger A. Horn Vladimir V. Sergeichuk

We use methods of the general theory of congruence and *congruence for complex matrices—regularization and cosquares—to determine a unitary congruence canonical form (respectively, a unitary *congruence canonical form) for complex matrices A such that ĀA (respectively, A) is normal. As special cases of our canonical forms, we obtain—in a coherent and systematic way—known canonical forms for con...

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

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