Source: wikibot/unary-language
= Unary language
{wiki=Unary_language}
A unary language is a formal language that uses a single symbol (or character) to represent its entire alphabet. In unary representation, strings are formed by repeating this symbol multiple times. For example, if the symbol is "1", the unary strings could be: - The empty string (representing 0), - "1" (representing 1), - "11" (representing 2), - "111" (representing 3), - and so on.