Unary language
In computational complexity theory, a unary language or tally language is a formal language (a set of strings) where all strings have the form 1k, where "1" can be any fixed symbol. For example, the language {1, 111, 1111} is unary, as is the language {1k | k is prime}. The complexity class of all such languages is sometimes called TALLY.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Unary language
In computational complexity theory, a unary language or tally language is a formal language (a set of strings) where all strings have the form 1k, where "1" can be any fixed symbol. For example, the language {1, 111, 1111} is unary, as is the language {1k | k is prime}. The complexity class of all such languages is sometimes called TALLY.
has abstract
Em teoria da complexidade comp ...... r ou não é indecidível também.
@pt
En théorie des langages, en th ...... lettre, généralement notée 1.
@fr
In computational complexity th ...... y version is also undecidable.
@en
在計算複雜度理論內，一元語言或者結算語言是一種形式語言 (由 ...... | k是 質數}。這一類語言的複雜度類有時被叫做TALLY。
@zh
Link from a Wikipage to an external page
Wikipage page ID
12,769,341
page length (characters) of wiki page
Wikipage revision ID
1,003,700,717
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Em teoria da complexidade comp ...... ens pode ser chamada de TALLY.
@pt
En théorie des langages, en th ...... lettre, généralement notée 1.
@fr
In computational complexity th ...... ges is sometimes called TALLY.
@en
在計算複雜度理論內，一元語言或者結算語言是一種形式語言 (由 ...... | k是 質數}。這一類語言的複雜度類有時被叫做TALLY。
@zh
label
Langage unaire
@fr
Linguagem unária
@pt
Unary language
@en
一元語言
@zh