finite-path tree
Смотреть что такое "finite-path tree" в других словарях:
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Tree structure — A tree structure showing the possible hierarchical organization of an encyclopedia … Wikipedia
Tree of life (Kabbalah) — Part of a series on Kabbalah … Wikipedia
Computation tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… … Wikipedia
Computational tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… … Wikipedia
Alternating finite automaton — In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal transitions. For example, let A be an alternating automaton.* For an existential… … Wikipedia
Stern-Brocot tree — NOTOC In number theory, the Stern Brocot tree is a method of listing all non negative rational numbers (as well as a point representing infinity here represented formally as 1/0) in a tree structure. It was discovered independently by Moritz… … Wikipedia
Olive Tree Lab Terrain — Contents 1 Overview 2 Calculation Methods 3 Version History 3.1 Version 1.2 3.2 Version 1.3 … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
