String (computer science)

A string is a finite sequence of symbols drawn from an alphabet. Its symbols have an order, and the same symbol may appear more than once.

Alphabet (formal language theory): A finite, nonempty set of symbols used to form strings in formal language theory. An alphabet specifies exactly which symbols a string may contain.
String concatenation: The operation that joins two strings end to end to produce a new string. Concatenation combines strings while preserving their symbol order.
Text encoding: A system for representing text as sequences of numbers or bytes according to defined rules. Encoding turns textual symbols into data that computers can store and transmit.
Character (computing): A unit of text data representing a letter, digit, punctuation mark, or other symbol. A character can serve as one symbol in a string.
Empty string: The unique string containing no symbols, commonly denoted ε or λ. It is the string of length zero and acts as an identity in concatenation.
Lexicographic order: An ordering of sequences that compares symbols from left to right using an order on the alphabet. It provides a systematic way to compare strings.
Compiler: A program that translates source code into another representation, such as machine code. Compilers process source code as structured sequences of symbols.
Array (data structure): A data structure whose elements occupy indexed positions, typically with a fixed element type. Arrays are general indexed collections; strings conventionally contain symbols.
String length: The number of symbols in a string, counting repetitions. Length measures a string without depending on the symbols it contains.
String matching: The problem of finding occurrences of a specified string within another string or collection of strings. Matching searches for a pattern as a contiguous sequence.

Linked from 8 pages