Find link

language:

Find link is a tool written by Edward Betts.

searching for Transitive closure 64 found (233 total)

Action algebra (1,165 words) [view diff] exact match in snippet view article find links to article

residuated semilattice and a Kleene algebra. It adds the star or reflexive transitive closure operation of the latter to the former, while adding the left and right

Conversational state (Java EE) (168 words) [view diff] exact match in snippet view article

Conversational state are the field values of a session bean plus the transitive closure of the objects reachable from the bean's fields. The name "conversational"

Code (set theory) (329 words) [view diff] exact match in snippet view article

isomorphism between (ω,E) and (X, ∈ {\displaystyle \in } ) where X is the transitive closure of {x}. If X is finite (with cardinality n), then use n×n instead

Frameworks supporting the polyhedral model (2,887 words) [view diff] exact match in snippet view article find links to article

stated in terms of the transitive closure of the dependence information. Both the Omega Library and isl provide a transitive closure operation that is exact

Subcompact cardinal (348 words) [view diff] exact match in snippet view article find links to article

with critical point κ and j(κ) = μ. H(λ) consists of all sets whose transitive closure has cardinality less than λ. Every quasicompact cardinal is subcompact

Hereditary property (1,698 words) [view diff] exact match in snippet view article find links to article

sets. Equivalently, a set is hereditarily finite if and only if its transitive closure is finite. A hereditarily countable set is a countable set of hereditarily

Rakesh Agrawal (computer scientist) (401 words) [view diff] exact match in snippet view article

environment), Alpha (extension of relational databases with generalized transitive closure), Nest distributed system, transaction management, and database machines

Relation (mathematics) (3,737 words) [view diff] exact match in snippet view article

its restrictions. However, the transitive closure of a restriction is a subset of the restriction of the transitive closure, i.e., in general not equal.

Path-based strong component algorithm (612 words) [view diff] exact match in snippet view article find links to article

MR 1761551. Munro, Ian (1971), "Efficient determination of the transitive closure of a directed graph", Information Processing Letters, 1 (2): 56–58

Confluence (abstract rewriting) (1,744 words) [view diff] exact match in snippet view article

of a reduction sequence from c to d. Formally, ∗→ is the reflexive-transitive closure of →. Using the example from the previous paragraph, we have (11+9)×(2+4)

Hereditary set (279 words) [view diff] exact match in snippet view article find links to article

non-inductively as follows: a set is hereditary if and only if its transitive closure contains only sets. In this way the concept of hereditary sets can

Syntactic methods (590 words) [view diff] exact match in snippet view article find links to article

important; while looking at the transitive closure of a system (all nodes downstream from a node), a node in its own transitive closure indicates a circularity;

Hereditarily countable set (74 words) [view diff] exact match in snippet view article find links to article

countable if and only if it is countable, and every element of its transitive closure is countable. Hereditarily finite set Constructible universe "On Hereditarily

Laver function (190 words) [view diff] exact match in snippet view article find links to article

denotes the κ-th level of the cumulative hierarchy, TC(x) is the transitive closure of x) The original application of Laver functions was the following

Church–Rosser theorem (1,203 words) [view diff] exact match in snippet view article find links to article

denoted by → β {\displaystyle \rightarrow _{\beta }} and its reflexive, transitive closure by ↠ β {\displaystyle \twoheadrightarrow _{\beta }} then the Church–Rosser

Ordinal definable set (441 words) [view diff] exact match in snippet view article find links to article

ordinal definable if it is ordinal definable and all elements of its transitive closure are ordinal definable. The class of hereditarily ordinal definable

Quicksort (9,881 words) [view diff] exact match in snippet view article find links to article

only swapped in case their relative order has been obtained in the transitive closure of prior comparison-outcomes. Most implementations of quicksort are

Tree stack automaton (876 words) [view diff] exact match in snippet view article find links to article

stack c such that (qi, ci, w) ⊢* (q, c, ε) where ⊢* is the reflexive transitive closure of ⊢ and ci = (ti, ε) such that ti assigns for ε the symbol @ and

Parity function (859 words) [view diff] exact match in snippet view article find links to article

results were also established for the majority, multiplication and transitive closure functions, by reduction from the parity function. Håstad (1987) established

Hereditarily finite set (1,429 words) [view diff] exact match in snippet view article find links to article

countable. Equivalently, a set is hereditarily finite if and only if its transitive closure is finite. Constructive set theory Finite set Hereditary set Hereditarily

Axiom of regularity (2,937 words) [view diff] exact match in snippet view article find links to article

von Neumann's axiomatization. Suppose x is any set. Let t be the transitive closure of {x}. Let u be the subset of t consisting of unranked sets. If u

Permutation model (370 words) [view diff] exact match in snippet view article find links to article

and is called hereditarily symmetric if it and all elements of its transitive closure are symmetric. The permutation model consists of all hereditarily

Permutation model (370 words) [view diff] exact match in snippet view article find links to article

and is called hereditarily symmetric if it and all elements of its transitive closure are symmetric. The permutation model consists of all hereditarily

Primitive recursive set function (564 words) [view diff] exact match in snippet view article find links to article

recursive set functions: TC, the function assigning to a set its transitive closure.: 26 Given hereditarily finite c {\displaystyle c} , the constant

Nondeterministic Turing machine (1,663 words) [view diff] exact match in snippet view article find links to article

common to omit the stationary (0) output, and instead insert the transitive closure of any desired stationary transitions. Some authors add an explicit

Breadth-first search (1,846 words) [view diff] exact match in snippet view article find links to article

a graph. Implementing parallel algorithms for computing a graph's transitive closure. Depth-first search Iterative deepening depth-first search Level structure

Logical matrix (1,868 words) [view diff] case mismatch in snippet view article find links to article

Fast Expected Time Algorithm for Boolean Matrix Multiplication and Transitive Closure". Information and Control. 22 (2): 132–138. doi:10.1016/s0019-9958(73)90228-3

Presentation of a monoid (785 words) [view diff] exact match in snippet view article find links to article

t ∈ Σ∗ with (u,v) ∈ R ∪ R−1. Finally, one takes the reflexive and transitive closure of E, which then is a monoid congruence. In the typical situation

Constructible universe (6,092 words) [view diff] exact match in snippet view article find links to article

transitive set containing A {\displaystyle A} as an element, i.e. the transitive closure of { A } {\displaystyle \{A\}} . L α + 1 ( A ) {\displaystyle L_{\alpha

Algebraic structure (2,684 words) [view diff] exact match in snippet view article find links to article

equational identities (the axioms), one may consider their symmetric, transitive closure E. The quotient algebra T/E is then the algebraic structure or variety

Beth number (1,696 words) [view diff] exact match in snippet view article find links to article

ur-elements form a set which is equinumerous with a pure set (a set whose transitive closure contains no ur-elements). If the axiom of choice holds, then any set

Kleene algebra (1,914 words) [view diff] exact match in snippet view article find links to article

to be the union, · to be the composition and * to be the reflexive transitive closure, we obtain a Kleene algebra. Every Boolean algebra with operations

Jensen hierarchy (1,201 words) [view diff] exact match in snippet view article find links to article

under pairing, Δ 0 {\displaystyle \Delta _{0}} -comprehension and transitive closure. Moreover, they have the property that J α + 1 ∩ P ( J α ) = Def (

Giuseppe F. Italiano (464 words) [view diff] exact match in snippet view article find links to article

Camil; Italiano, Giuseppe F. (2005), "Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2) barrier" (PDF), Journal of the

Quasi-set theory (1,496 words) [view diff] exact match in snippet view article find links to article

{\displaystyle {\mathfrak {Q}}} -sets') turn out to be those q-sets whose transitive closure contains no m-atoms. In Q {\displaystyle {\mathfrak {Q}}} there may

Automatic label placement (1,545 words) [view diff] exact match in snippet view article find links to article

are rivals if they can overlap in one of the possible placements. Transitive closure of this relation divides the set of labels into possibly much smaller

Matrix grammar (1,225 words) [view diff] exact match in snippet view article find links to article

i\leq r.} Let ⇒ ∗ {\displaystyle \Rightarrow ^{*}} be the reflexive transitive closure of the relation ⇒ {\displaystyle \Rightarrow } . Then, the language

Immerman–Szelepcsényi theorem (1,272 words) [view diff] case mismatch in snippet view article find links to article

proved that, using descriptive complexity's equality between NL and FO(Transitive Closure), the logarithmic hierarchy, i.e. the languages decided by an alternating

Indexed grammar (2,718 words) [view diff] exact match in snippet view article find links to article

As usual, the derivation relation ∗⇒ is defined as the reflexive transitive closure of direct derivation ⇒. The language L(G) = { w ∈ T*: S ∗⇒ w } is

Program structure tree (1,164 words) [view diff] exact match in snippet view article find links to article

usefulness of SPQR-trees for various on-line graph algorithms, e.g., transitive closure, planarity testing, and minimum spanning tree. In particular, the

Monika Henzinger (596 words) [view diff] case mismatch in snippet view article find links to article

Monika; King, Valerie (1995), "Fully Dynamic Biconnectivity and Transitive Closure", 36th Annual Symposium on Foundations of Computer Science (FOCS'95)

Quasiregular element (1,658 words) [view diff] exact match in snippet view article find links to article

ISBN 978-1-118-01086-0. Lehmann, D. J. (1977). "Algebraic structures for transitive closure" (PDF). Theoretical Computer Science. 4: 59–76. doi:10.1016/0304-3975(77)90056-1

Formal grammar (3,431 words) [view diff] exact match in snippet view article find links to article

(pronounced as G derives in zero or more steps) is defined as the reflexive transitive closure of ⇒ G {\displaystyle {\underset {G}{\Rightarrow }}} a sentential

Smith set (1,903 words) [view diff] exact match in snippet view article find links to article

Proves that the Schwartz set is the set of undominated elements of the transitive closure of the pairwise preference relation. Somdeb Lahiri (nd), "Group and

Monoid (4,447 words) [view diff] exact match in snippet view article find links to article

t ∈ Σ∗ with (u,v) ∈ R ∪ R−1. Finally, one takes the reflexive and transitive closure of E, which is then a monoid congruence. In the typical situation

Bisimulation (2,013 words) [view diff] exact match in snippet view article find links to article

bisimulation. Bisimulations are also closed under reflexive, symmetric, and transitive closure; therefore, the largest bisimulation must be reflexive, symmetric

Distance-hereditary graph (2,290 words) [view diff] exact match in snippet view article find links to article

neighborhood of any vertex in a distance-hereditary graph is a cograph. The transitive closure of the directed graph formed by choosing any set of orientations for

Yefim Dinitz (1,655 words) [view diff] exact match in snippet view article find links to article

9781611973730.16. ISBN 978-1-61197-374-7. "On economical construction of the transitive closure of an oriented graph". Math-Net.Ru. Retrieved 24 December 2023. Arlazarov

Count-distinct problem (1,783 words) [view diff] exact match in snippet view article find links to article

Cohen, Edith (1997). "Size-estimation framework with applications to transitive closure and reachability". J. Comput. Syst. Sci. 55 (3): 441–453. doi:10.1006/jcss

Pointer jumping (1,429 words) [view diff] exact match in snippet view article find links to article

ISBN 0-201-54856-9. Hirschberg, D. S. (1976). "Parallel algorithms for the transitive closure and the connected component problems". Proceedings of the eighth annual

Asterisk (6,030 words) [view diff] exact match in snippet view article find links to article

cohomology groups Hk(X) into the cohomology ring H*(X). The reflexive transitive closure of a binary relation. In statistics, z* and t* are given critical

Loop variant (1,537 words) [view diff] exact match in snippet view article find links to article

otherwise the loop would fail to terminate. Next consider the reflexive, transitive closure of the "successor" relation. Call this iteration: we say that a state

Context-sensitive grammar (3,503 words) [view diff] exact match in snippet view article find links to article

the relation ⇒ ∗ {\displaystyle \Rightarrow ^{*}} is the reflexive transitive closure of the relation ⇒ {\displaystyle \Rightarrow } . The language of the

Implementation of mathematics in set theory (10,976 words) [view diff] exact match in snippet view article find links to article

type of W α {\displaystyle W_{\alpha }} . Each set A of ZFC has a transitive closure T C ( A ) {\displaystyle TC(A)} (the intersection of all transitive

Semi-Thue system (3,402 words) [view diff] exact match in snippet view article find links to article

zero-or-more-steps rewriting like this is captured by the reflexive transitive closure of → R {\displaystyle {\xrightarrow[{R}]{}}} , denoted by → R ∗ {\displaystyle

Upward planar drawing (2,316 words) [view diff] exact match in snippet view article find links to article

not have an upward planar drawing (take the order defined by the transitive closure of a < b , a < c , b < d , b < e , c < d , c < e , d < f , e < f {\displaystyle

Lambda cube (3,102 words) [view diff] exact match in snippet view article find links to article

{A\to _{\beta }A'}{\Pi x:A.B\to _{\beta }\Pi x:A'.B}}} Its reflexive, transitive closure is written = β {\displaystyle =_{\beta }} . The following typing rules

Kripke semantics (4,751 words) [view diff] exact match in snippet view article find links to article

w_{n+1}\rangle } , but many applications need the reflexive and/or transitive closure of this relation, or similar modifications. Filtration is a useful

Petri net (7,229 words) [view diff] exact match in snippet view article find links to article

{\overset {*}{\underset {G}{\longrightarrow }}}} is the reflexive transitive closure of ⟶ G {\displaystyle {\underset {G}{\longrightarrow }}} ; that is

Automatic parallelization tool (2,259 words) [view diff] exact match in snippet view article find links to article

Framework. The core is based on the Presburger Arithmetic and the transitive closure operation. Loop dependencies are represented with relations. TRACO

Glossary of Principia Mathematica (1,102 words) [view diff] exact match in snippet view article find links to article

multiplicative axiom, a form of the axiom of choice *88.03 R* The transitive closure of the relation R *90.01 Rst, Rts Relations saying that one relation

Multiple dispatch (5,881 words) [view diff] exact match in snippet view article find links to article

on several other packages, and the whole program consisting of the transitive closure of the dependency relationship. The so-called expression problem relates

Epsilon-induction (4,192 words) [view diff] exact match in snippet view article find links to article

postulated, the transitive containment axiom. Existence of the stronger transitive closure with respect to membership, for any set, can also be derived from

Mobile membranes (7,128 words) [view diff] exact match in snippet view article find links to article

∗ {\displaystyle \Rightarrow _{amb}^{*}} denotes a reflexive and transitive closure of the binary relation ⇒ a m b {\displaystyle \Rightarrow _{amb}}