英和和英

出典:『Wikipedia』 (2011/02/25 02:02 UTC 版)

英語による解説

引用

In computational complexity theory, a unary language or tally language is a formal language (a set of strings) where all strings have the form 1^k, where "1" can be any fixed symbol. For example, the language {1, 111, 1111} is unary, as is the language {1^k | k is prime}. The complexity class of all such languages is sometimes called TALLY.