Formal language compression
Formal languages are computer languages and have their own rules and laws of formation, grammars, and connectivity, the structural qualities inherent in unions of parts of the whole. These are, by nature, linear and have the qualities of being mathematical in that they are represented as binary sequential strings. Computers use formal languages that are limited to type of the input devices to input the information into the and the primary ‘limiter’ to this information is the computer key board, a modified version of the ‘QWERTY’ typewriter key board that was invented in 1878 with the popular success of the No. 2 Remington typewriter (Wikipedia, ‘QWERTY’, 2013: 1). The language of mathematics is system of both natural languages, say the English language, that is invested with technical terms and grammar conventions to a specialized symbolic notation system (Wikipedia, 2013, “Language of mathematics”: 1-8). The vocabulary of mathematics is by the use of notations that have grown over the years as mathematical developments have occurred. The grammar of mathematics is the specific use of a mathematical notation system, the rules that underlie ‘how’ and ‘when’ a particular notation is to be used with the framework of a mathematical discipline (Wikipedia, 2013, “Language of mathematics”: 4). An example would be the English word formula one plus one equals two that can be mathematically notated as 1 + 1 = 2. A hybrid of the two language systems, natural language and mathematical formalisms such as the word formula for one plus one equals two can be written as 1 + one equals 2.