finite(-length) string

См. также в других словарях:

• String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… …   Wikipedia

• String searching algorithm — String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be… …   Wikipedia

• Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… …   Wikipedia

• String instrument — A string instrument (or stringed instrument) is a musical instrument that produces sound by means of vibrating strings. In the Hornbostel Sachs scheme of musical instrument classification, used in organology, they are called chordophones. The… …   Wikipedia

• String theory — This article is about the branch of theoretical physics. For other uses, see String theory (disambiguation). String theory …   Wikipedia

• Variable-length code — In coding theory a variable length code is a code which maps source symbols to a variable number of bits. Variable length codes can allow sources to be compressed and decompressed with zero error (lossless data compression) and still be read back …   Wikipedia

• Aho–Corasick string matching algorithm — The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary matching algorithm that locates elements of a finite set of strings (the dictionary ) within …   Wikipedia

• Generalized nondeterministic finite state machine — In the theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA) is a NFA where each transition may be labeled with any regular expression. The GNFA reads blocks of symbols… …   Wikipedia

• Cosmic string — Not to be confused with string in string theory. Cosmic strings are hypothetical 1 dimensional (spatially) topological defects which may have formed during a symmetry breaking phase transition in the early universe when the topology of the vacuum …   Wikipedia

• Black string — A black string is a higher dimensional ( D >4) generalization of a black hole in which the event horizon is topologically equivalent to S 2 times; S 1 and spacetime is asymptotically M d −1 times; S 1. Perturbations of black string solutions were …   Wikipedia

• Minimum description length — The minimum description length (MDL) principle is a formalization of Occam s Razor in which the best hypothesis for a given set of data is the one that leads to the best compression of the data. MDL was introduced by Jorma Rissanen in 1978. It is …   Wikipedia