Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,724,780 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Complexity class
Computational complexity theory
Formal language
Kleene star
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Concatenation of Regular Languages and Descriptional Complexity
Galina Jirásková
Theory of Computing Systems
2009
Corpus ID: 30724098
We investigate the deterministic and nondeterministic state complexity of languages resulting from the concatenation of two…
Expand
2009
2009
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Mônica Ribeiro Porto Ferreira
,
A. Traina
,
I. Dias
,
R. Chbeir
,
C. Traina
Alberto Mendelzon Workshop on Foundations of Data…
2009
Corpus ID: 15844016
Abstract. Conventional operators for data retrieval are either based on exact matching or on total order relationship among…
Expand
2008
2008
Conjunctive Grammars Generate Non-Regular Unary Languages
Artur Jeż
International Journal of Foundations of Computer…
2008
Corpus ID: 19257158
Conjunctive grammars, introduced by Okhotin, extend context-free grammars by an additional operation of intersection in the body…
Expand
Highly Cited
2008
Highly Cited
2008
Conjunctive Grammars Can Generate Non-regular Unary Languages
Artur Jeż
International Conference on Developments in…
2008
Corpus ID: 585857
Conjunctive grammars were introduced by A. Okhotin in [1] as a natural extension of context-free grammars with an additional…
Expand
2005
2005
Small size quantum automata recognizing some regular languages
A. Bertoni
,
C. Mereghetti
,
Beatrice Palano
Theoretical Computer Science
2005
Corpus ID: 15909061
1997
1997
Generalized nondeterminism and the succinct representation of regular languages
L. V. Zijl
1997
Corpus ID: 60853590
Declaration I the undersigned hereby declare that the work contained in this dissertation is my own original work and has not…
Expand
1991
1991
Polynomial-Time Reducibilities and "Almost All" Oracle Sets
Shouwen Tang
,
R. V. Book
Theoretical Computer Science
1991
Corpus ID: 26408600
1991
1991
Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set
Roy S. Rubinstein
SIAM journal on computing (Print)
1991
Corpus ID: 35172721
The class of self-P-printable sets, those sets that are enumerable in polynomial time relative to themselves, has been shown to…
Expand
1988
1988
On tally relativizations of BP-complexity classes
Shouwen Tang
,
O. Watanabe
[] Proceedings. Structure in Complexity Theory…
1988
Corpus ID: 35456018
The concept of a random tally set is introduced. Relativization of BP-complexity classes with respect to a tally oracle is…
Expand
1979
1979
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
A. Selman
Mathematical Systems Theory
1979
Corpus ID: 20957388
The notion ofp-selective sets, and tally languages, are used to study polynomial time reducibilities onNP. P-selectivity has the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE