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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Limited automata are one-tape Turing machines that are allowed to rewrite the content of any tape cell only in the first d visits… (More)
Is this relevant?
2007
2007
Devices of interconnected parallel acting sequential auto ma a are investigated from a language theoretic point of view. Starting… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2007
2007
Conjunctive grammars were introduced by A. Okhotin in [1] as a natural extension of context-free grammars with an additional… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2007
2007
We investigate the computational complexity of the nondeterministic finite automaton (NFA) minimization problem for finite and… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper we give the cost, in terms of states, of some basic operations (union, intersection, concatenation, and Kleene star… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
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… (More)
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… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We prove tha t if P ¢ NP, then there exists a set in NP tha t is po lynomia l t ime bounded t ru thtable reducible (in short… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We prove that O(e " t'/gT-~g~") states are sufficient to simulate an n-state lnfa recognizing a unary language by a ldfa. The… (More)
  • figure 1
Is this relevant?
1979
1979
The notion ofp-selective sets, and tally languages, are used to study polynomial time reducibilities onNP. P-selectivity has the… (More)
Is this relevant?