We are working to restore the Unionpedia app on the Google Play Store
OutgoingIncoming
🌟We've simplified our design for better navigation!
Instagram Facebook X LinkedIn
Your own Unionpedia with your logo and domain, from 9.99 USD/month
Create my Unionpedia

Algorithmic Combinatorics on Partial Words

Index Algorithmic Combinatorics on Partial Words

Algorithmic Combinatorics on Partial Words is a book in the area of combinatorics on words, and more specifically on partial words. [1]

Table of Contents

  1. 10 relations: ACM SIGACT, Alphabet (formal languages), Combinatorics on words, European Mathematical Society, Jan Kratochvíl, MathSciNet, Miklós Bóna, Partial word, String (computer science), Wildcard character.

ACM SIGACT

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science.

See Algorithmic Combinatorics on Partial Words and ACM SIGACT

Alphabet (formal languages)

In formal language theory, an alphabet, sometimes called a vocabulary, is a non-empty set of indivisible symbols/characters/glyphs, typically thought of as representing letters, characters, digits, phonemes, or even words. Algorithmic Combinatorics on Partial Words and alphabet (formal languages) are combinatorics on words.

See Algorithmic Combinatorics on Partial Words and Alphabet (formal languages)

Combinatorics on words

Combinatorics on words is a fairly new field of mathematics, branching from combinatorics, which focuses on the study of words and formal languages.

See Algorithmic Combinatorics on Partial Words and Combinatorics on words

European Mathematical Society

The European Mathematical Society (EMS) is a European organization dedicated to the development of mathematics in Europe.

See Algorithmic Combinatorics on Partial Words and European Mathematical Society

Jan Kratochvíl

Jan Kratochvíl (born 10 February 1959) is a Czech mathematician and computer scientist whose research concerns graph theory and intersection graphs.

See Algorithmic Combinatorics on Partial Words and Jan Kratochvíl

MathSciNet

MathSciNet is a searchable online bibliographic database created by the American Mathematical Society in 1996.

See Algorithmic Combinatorics on Partial Words and MathSciNet

Miklós Bóna

Miklós Bóna (born in Székesfehérvár) is an American mathematician of Hungarian origin.

See Algorithmic Combinatorics on Partial Words and Miklós Bóna

Partial word

In computer science and the study of combinatorics on words, 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. Algorithmic Combinatorics on Partial Words and partial word are combinatorics on words.

See Algorithmic Combinatorics on Partial Words and Partial word

String (computer science)

In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. Algorithmic Combinatorics on Partial Words and string (computer science) are combinatorics on words.

See Algorithmic Combinatorics on Partial Words and String (computer science)

Wildcard character

In software, a wildcard character is a kind of placeholder represented by a single character, such as an asterisk, which can be interpreted as a number of literal characters or an empty string.

See Algorithmic Combinatorics on Partial Words and Wildcard character

References

[1] https://en.wikipedia.org/wiki/Algorithmic_Combinatorics_on_Partial_Words