Linked from

The 8 pages that link to String (computer science), each with the reason it gives.

• Formal languageBroader topic: A formal language consists of strings, including possibly the empty string.

• Finite-state machineRelated: A machine commonly processes an input as a string of symbols.

• Deterministic finite automatonRelated: Strings are the inputs the automaton processes.

• Finite automatonRelated: An automaton processes its input one symbol at a time.

• Pumping lemma for regular languagesRelated: The lemma divides one sufficiently long string into three consecutive parts.

• Text editorNarrower topic: Text editors manipulate strings, though their files and buffers may use richer structures.

• AnagramNarrower topic: Anagrams treat words and phrases as character sequences to be rearranged.

• Pumping lemma for context-free languagesRelated: The lemma decomposes one sufficiently long string into five consecutive parts.