Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Electronic version of an article published as International Journal of Foundations of Computer Science, 23(06), 2012, 1261–1276… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
2009
2009
AbstractTheorem: For each 2 ≤ k < ω there is an $$ L_{\omega _1 ,\omega } $$-sentence ϕk such that(1) ϕk is categorical in μ if… Expand
Is this relevant?
2008
2008
  • A. Jez
  • Int. J. Found. Comput. Sci.
  • 2008
  • Corpus ID: 19257158
Conjunctive grammars, introduced by Okhotin, extend context-free grammars by an additional operation of intersection in the body… Expand
Is this relevant?
2002
2002
We investigate the costs, in terms of states, of operations on infinite and finite unary regular languages where the languages… Expand
Is this relevant?
1999
1999
At the moment there is no theory for free relative clauses in German in the framework of Head-driven Phrase Structure Grammar… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We prove that if P # NP, then there exists a set in NP that is polynomial time bounded truth-table reducible (in short, <Ft… Expand
Is this relevant?
1989
1989
It is known that $AM = BP \cdot NP$. Babai [Proc. 17th Annual ACM Symposium Theory of Computing, 1985, pp. 421–429] and… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
  • M. Chrobak
  • Theor. Comput. Sci.
  • 1986
  • Corpus ID: 205092500
Abstract We prove that O(e √ n log n ) states are sufficient to simulate an n -state 1nfa recognizing a unary language by a 1dfa… Expand
  • figure 1
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Baker, Gill, and Solovay constructed sparse sets <italic>A</italic> and <italic>B</italic> such that P(<italic>A</italic>) ≠ NP… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The notion of p-selective sets, and tally languages, are used to study polynomial time reducibilities on NP. P-selectivity has… Expand
Is this relevant?