- finite string
- мат. конечная последовательность
Большой англо-русский и русско-английский словарь. 2001.
finite string
Смотреть что такое "finite string" в других словарях:
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
Finite model theory — is a subfield of model theory that focuses on properties of logical languages, such as first order logic, over finite structures, such as finite groups, graphs, databases, and most abstract machines. It focuses in particular on connections… … Wikipedia
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
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
String operations — In computer science, in the area of formal language theory, frequent use is made of a variety of string functions; however, the notation used is different from that used on computer programming, and some commonly used functions in the theoretical … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite thickness — In formal language theory, a class of languages mathcal L has finite thickness if for every string s , there are only finite consistent languages in mathcal L. This condition was introduced by Dana Angluin in connection with learning, as a… … Wikipedia
String theory — This article is about the branch of theoretical physics. For other uses, see String theory (disambiguation). String theory … 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 — stringless, adj. stringlike, adj. /string/, n., v., strung; strung or (Rare) stringed; stringing. n. 1. a slender cord or thick thread used for binding or tying; line. 2. something resembling a cord or thread. 3. Physics. a mathematical entity… … Universalium
