Montenegrin alphabetThe Montenegrin alphabet is the collective name given to "Abeceda" (Montenegrin Latin alphabet) and "Азбука" (Montenegrin Cyrillic alphabet), the writing systems used to write the Montenegrin language. It was adopted on 9 June 2009 by the Montenegrin Minister of Education, Sreten Škuletić and replaced the Serbian Cyrillic and Gaj's Latin alphabets in use at the time.
Phoenician alphabetThe Phoenician alphabet is an alphabet (more specifically, an abjad) known in modern times from the Canaanite and Aramaic inscriptions found across the Mediterranean region. The name comes from the Phoenician civilization. The Phoenician alphabet is also called the Early Linear script (in a Semitic context, not connected to Minoan writing systems), because it is an early development of the Proto- or Old Canaanite or Proto-Sinaitic script, into a linear, purely alphabetic script, also marking the transfer from a multi-directional writing system, where a variety of writing directions occurred, to a regulated horizontal, right-to-left script.
Probability distributionIn probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of different possible outcomes for an experiment. It is a mathematical description of a random phenomenon in terms of its sample space and the probabilities of events (subsets of the sample space). For instance, if X is used to denote the outcome of a coin toss ("the experiment"), then the probability distribution of X would take the value 0.5 (1 in 2 or 1/2) for X = heads, and 0.
Joint probability distributionGiven two random variables that are defined on the same probability space, the joint probability distribution is the corresponding probability distribution on all possible pairs of outputs. The joint distribution can just as well be considered for any given number of random variables. The joint distribution encodes the marginal distributions, i.e. the distributions of each of the individual random variables. It also encodes the conditional probability distributions, which deal with how the outputs of one random variable are distributed when given information on the outputs of the other random variable(s).
Prefix codeA prefix code is a type of code system distinguished by its possession of the "prefix property", which requires that there is no whole code word in the system that is a prefix (initial segment) of any other code word in the system. It is trivially true for fixed-length code, so only a point of consideration in variable-length code. For example, a code with code words {9, 55} has the prefix property; a code consisting of {9, 5, 59, 55} does not, because "5" is a prefix of "59" and also of "55".
History of the Greek alphabetThe history of the Greek alphabet starts with the adoption of Phoenician letter forms in the 9th–8th centuries BC during early Archaic Greece and continues to the present day. The Greek alphabet was developed during the Iron Age, centuries after the loss of Linear B, the syllabic script that was used for writing Mycenaean Greek until the Late Bronze Age collapse and Greek Dark Age. This article concentrates on the development of the alphabet before the modern codification of the standard Greek alphabet.
Serbian Cyrillic alphabetThe Serbian Cyrillic alphabet (Српска ћирилица / Srpska ćirilica, sr̩̂pskaː tɕirǐlitsa) is a variation of the Cyrillic script used to write the Serbian language, adapted in 1818 by the Serbian philologist and linguist Vuk Karadžić. It is one of the two alphabets used to write modern standard Serbian, the other being Gaj's Latin alphabet. Karadžić based his alphabet on the previous Slavonic-Serbian script, following the principle of "write as you speak and read as it is written", removing obsolete letters and letters representing iotated vowels, introducing from the Latin alphabet instead, and adding several consonant letters for sounds specific to Serbian phonology.
Conditional entropyIn information theory, the conditional entropy quantifies the amount of information needed to describe the outcome of a random variable given that the value of another random variable is known. Here, information is measured in shannons, nats, or hartleys. The entropy of conditioned on is written as . The conditional entropy of given is defined as where and denote the support sets of and . Note: Here, the convention is that the expression should be treated as being equal to zero. This is because .
Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
Suffix treeIn computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations of many important string operations. The construction of such a tree for the string takes time and space linear in the length of .
Complex random variableIn probability theory and statistics, complex random variables are a generalization of real-valued random variables to complex numbers, i.e. the possible values a complex random variable may take are complex numbers. Complex random variables can always be considered as pairs of real random variables: their real and imaginary parts. Therefore, the distribution of one complex random variable may be interpreted as the joint distribution of two real random variables.
