# Unary language

## Papers overview

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

2017

2017

- DLT
- 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

- Fundam. Inform.
- 2007

Devices of interconnected parallel acting sequential auto ma a are investigated from a language theoretic point of view. Startingâ€¦Â (More)

Is this relevant?

2007

2007

- Developments in Language Theory
- 2007

Conjunctive grammars were introduced by A. Okhotin in [1] as a natural extension of context-free grammars with an additionalâ€¦Â (More)

Is this relevant?

2007

2007

- LATA
- 2007

We investigate the computational complexity of the nondeterministic finite automaton (NFA) minimization problem for finite andâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Int. J. Found. Comput. Sci.
- 2002

In this paper we give the cost, in terms of states, of some basic operations (union, intersection, concatenation, and Kleene starâ€¦Â (More)

Is this relevant?

2002

2002

- Developments in Language Theory
- 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

- Grammars
- 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

- STOC
- 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

- Theor. Comput. Sci.
- 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)

Is this relevant?

1979

1979

- Mathematical systems theory
- 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?