Unary language

Known as: TALLY, Tally language, Tally set

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Let /C be a class of (universal) algebras of fixed type. /C* denotes the class obtained by augmenting each member of K, by the…

2007

In the present paper, we investigate the question on the reconstructability (up to isomorphism) of a finite unary algebra from…

2003

We give two flashes from the world of unary languages related to the study of tight computational lower bounds for nonregular…

2002

A method for building up bidirection label switched path, this method starts from initial node of bidirection label switched path…

1997

We prove that every recursively enumerable language can be generated by a programmed grammar with context-free core rules using…

1995

We study the polynomial-time semi-rankable sets (P-sr), the ranking analog of the P-selective sets. We prove that P-sr is a…

1993

A number of theorems are proved by introducing the notion of k-families of sets of strings, and an algorithm which outputs the…

1991

The class of self-P-printable sets, those sets that are enumerable in polynomial time relative to themselves, has been shown to…

1988

A restricted relativization of NP, denoted ${\text{NP}}_B ( \cdot )$,was introduced in [SIAM J. Comput., 13 (1984), pp. 461– 487…