SettingsCombinatorics on words
Alphabet (computer science)
In computer science and mathematical logic, an alphabet is a finite set of symbols or letters, e.g. characters or digits.
In computer science and mathematical logic, an alphabet is a finite set of symbols or letters, e.g. characters or digits.
Automatic group
In mathematics, an automatic group is a finitely generated group equipped with several finite-state automata.
In mathematics, an automatic group is a finitely generated group equipped with several finite-state automata.
Automatic sequence
An automatic sequence (or k-automatic sequence) is an infinite sequence of terms characterized by a finite automaton.
An automatic sequence (or k-automatic sequence) is an infinite sequence of terms characterized by a finite automaton.
Beatty sequence
In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of a positive irrational number.
In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of a positive irrational number.
Combinatorics on words
Combinatorics on words is a branch of mathematics which applies combinatorics to words and formal languages.
Combinatorics on words is a branch of mathematics which applies combinatorics to words and formal languages.
Cyclically reduced word
In mathematics, cyclically reduced word is a concept of combinatorial group theory.
In mathematics, cyclically reduced word is a concept of combinatorial group theory.
Davenport-Schinzel sequence
In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.
In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.
Davenport–Schinzel sequence
In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.
In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.
Dehn function
In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a re...
In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a re...
Formal language
A formal language is a set of words—that is, strings of symbols drawn from a common alphabet (a finite set of symbols, letters, or tokens from which the words of the language may be formed).
A formal language is a set of words—that is, strings of symbols drawn from a common alphabet (a finite set of symbols, letters, or tokens from which the words of the language may be formed).
Free lattice
In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.
In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.
Free monoid
In abstract algebra, the free monoid on a set A is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from A.
In abstract algebra, the free monoid on a set A is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from A.
Free object
In mathematics, the idea of a free object is one of the basic concepts of abstract algebra.
In mathematics, the idea of a free object is one of the basic concepts of abstract algebra.
Grammar systems theory
Grammar systems theory is a field of theoretical computer science that studies systems of finite collections of formal grammars generating a formal language.
Grammar systems theory is a field of theoretical computer science that studies systems of finite collections of formal grammars generating a formal language.
HNN extension
In mathematics, the HNN extension is a basic construction of combinatorial group theory.
In mathematics, the HNN extension is a basic construction of combinatorial group theory.
Hobby-Rice theorem
In mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain solutions.
In mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain solutions.
Hobby–Rice theorem
In mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain solutions.
In mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain solutions.
Hyperbolic group
In group theory, a hyperbolic group, also known as a word hyperbolic group, Gromov hyperbolic group, negatively curved group is a finitely generated group equipped with a word metric...
In group theory, a hyperbolic group, also known as a word hyperbolic group, Gromov hyperbolic group, negatively curved group is a finitely generated group equipped with a word metric...
Knuth-Bendix completion algorithm
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Lattice word
In mathematics, a lattice word (or lattice permutation) is a sequence of integers such that in every initial part of the sequence any number i occurs at least as often as the number '...
In mathematics, a lattice word (or lattice permutation) is a sequence of integers such that in every initial part of the sequence any number i occurs at least as often as the number '...
Locally catenative sequence
In mathematics, a locally catenative sequence is a sequence of words in which each word can be constructed as the concatenation of previous words in the sequence.
In mathematics, a locally catenative sequence is a sequence of words in which each word can be constructed as the concatenation of previous words in the sequence.
Lyndon word
In mathematics, in the areas of combinatorics and computer science, a Lyndon word is a certain type of string over an alphabet, the lexicographically minimal representative of a set of aperiodic...
In mathematics, in the areas of combinatorics and computer science, a Lyndon word is a certain type of string over an alphabet, the lexicographically minimal representative of a set of aperiodic...
Necklace (combinatorics)
In combinatorics, a k-ary necklace of length n is an equivalence class of n-character strings over an alphabet of size k, taking all rotations as equivalent.
In combinatorics, a k-ary necklace of length n is an equivalence class of n-character strings over an alphabet of size k, taking all rotations as equivalent.
Necklace problem
The necklace problem is a problem in recreational mathematics, solved in the early 21st century.
The necklace problem is a problem in recreational mathematics, solved in the early 21st century.
Necklace splitting problem
In mathematics, and in particular combinatorics, the necklace splitting problem arises in a variety of contexts including exact division; its picturesque name is due to mathematicians Noga Alon ...
In mathematics, and in particular combinatorics, the necklace splitting problem arises in a variety of contexts including exact division; its picturesque name is due to mathematicians Noga Alon ...
Nielsen transformation
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, Nielsen transformations, named after Jakob Nielsen, are certain automorphisms of a free group whic...
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, Nielsen transformations, named after Jakob Nielsen, are certain automorphisms of a free group whic...
Partial word
A partial word is a string that may contain a number of "do not know" or "do not care" symbols i.e. placeholders in the string where the symbol value is not known or not specified.
A partial word is a string that may contain a number of "do not know" or "do not care" symbols i.e. placeholders in the string where the symbol value is not known or not specified.
Ping-pong lemma
In mathematics, the ping-pong lemma, or table-tennis lemma, is any of several mathematical statements that ensure that several elements in a group acting on a set freely generate a free su...
In mathematics, the ping-pong lemma, or table-tennis lemma, is any of several mathematical statements that ensure that several elements in a group acting on a set freely generate a free su...
Plactic monoid
In mathematics, the plactic monoid is the monoid of all words in the alphabet of positive integers modulo Knuth equivalence.
In mathematics, the plactic monoid is the monoid of all words in the alphabet of positive integers modulo Knuth equivalence.
Presentation of a group
In mathematics, one method of defining a group is by a presentation.
In mathematics, one method of defining a group is by a presentation.
Random group
In mathematics, random groups are certain groups obtained by a probabilistic construction.
In mathematics, random groups are certain groups obtained by a probabilistic construction.
Shift space
In symbolic dynamics and related branches of mathematics, a shift space or subshift is a set of infinite words representing the evolution of a discrete system.
In symbolic dynamics and related branches of mathematics, a shift space or subshift is a set of infinite words representing the evolution of a discrete system.
Small cancellation theory
In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relation...
In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relation...
Specht's theorem
In mathematics, Specht's theorem gives a necessary and sufficient condition for two matrices to be unitarily equivalent.
In mathematics, Specht's theorem gives a necessary and sufficient condition for two matrices to be unitarily equivalent.
Squarefree word
In combinatorics, a square-free word is a word that does not contain any subword twice in a row.
In combinatorics, a square-free word is a word that does not contain any subword twice in a row.
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 which is called alphabet.
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 which is called alphabet.
Stringology
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 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.
Sturmian word
In mathematics, a Sturmian word, named after Jacques Charles François Sturm, is a certain kind of infinite word.
In mathematics, a Sturmian word, named after Jacques Charles François Sturm, is a certain kind of infinite word.
Subshift of finite type
In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory.
In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory.
Symbolic dynamics
In mathematics, symbolic dynamics is the practice of modeling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which cor...
In mathematics, symbolic dynamics is the practice of modeling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which cor...
Thue number
In the mathematical area of graph theory, the Thue number of a graph is a variation of the chromatic index, defined by Alon et al.
In the mathematical area of graph theory, the Thue number of a graph is a variation of the chromatic index, defined by Alon et al.
Train track map
In the mathematical subject of geometric group theory a train track map is a continuous map f from a finite connected graph to itself which is a homotopy equivalence and which has particular...
In the mathematical subject of geometric group theory a train track map is a continuous map f from a finite connected graph to itself which is a homotopy equivalence and which has particular...
Van Kampen diagram
In the mathematical area of geometric group theory, a van Kampen diagram is a planar diagram used to represent the fact that a particular word in the generators of a group given by a group prese...
In the mathematical area of geometric group theory, a van Kampen diagram is a planar diagram used to represent the fact that a particular word in the generators of a group given by a group prese...
Witt vector
In mathematics, a Witt vector is an infinite sequence of elements of a commutative ring.
In mathematics, a Witt vector is an infinite sequence of elements of a commutative ring.
Word (group theory)
In group theory, a word is any written product of group elements and their inverses.
In group theory, a word is any written product of group elements and their inverses.
Word problem (mathematics)
In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representati...
In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representati...
Word problem for groups
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding wh...
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding wh...
Word problem for semigroups
In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over strings from an (usually fi...
In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over strings from an (usually fi...
Young–Fibonacci lattice
In mathematics, the Young–Fibonacci graph and Young–Fibonacci lattice, named after Alfred Young and Leonardo Fibonacci, are two closely related structures involving sequences of the digits...
In mathematics, the Young–Fibonacci graph and Young–Fibonacci lattice, named after Alfred Young and Leonardo Fibonacci, are two closely related structures involving sequences of the digits...