Results 1  10
of
47,833
Nondeterministic State Complexity for SuffixFree Regular Languages
"... We investigate the nondeterministic state complexity of basic operations for suffixfree regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worstcase for a minimal nondeterministic finitestate automaton that a ..."
Abstract
 Add to MetaCart
We investigate the nondeterministic state complexity of basic operations for suffixfree regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worstcase for a minimal nondeterministic finitestate automaton
Nondeterministic State Complexity of Positional Addition
"... Consider nondeterministic finite automata recognizing basek positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterministic automata of m and n states, respectively, then ..."
Abstract
 Add to MetaCart
Consider nondeterministic finite automata recognizing basek positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterministic automata of m and n states, respectively
Nondeterministic State Complexity of Basic Operations for PrefixFree Regular Languages
, 2009
"... We investigate the nondeterministic state complexity of basic operations for prefixfree regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worstcase for a minimal nondeterministic finitestate automaton that ac ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We investigate the nondeterministic state complexity of basic operations for prefixfree regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worstcase for a minimal nondeterministic finitestate automaton
FINDING UPPER BOUNDS FOR NONDETERMINISTIC STATE COMPLEXITY IS HARD
"... Finite automata are one of the oldest and most intensely investigated computational models. Historically, the theory of finite automata counts among the oldest topics in computer science, and is one of the basic building blocks of the theory of formal languages. Its origins can be tracked back to th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, nondeterministic automata can be exponentially more succinct than deterministic ones. On the other hand, minimizing deterministic finite automata can be carried out efficiently, whereas the state minimization problem for nondeterministic finite state machines is PSPACEcomplete, even if the regular language
Finding lower bounds for nondeterministic state complexity is hard (extended abstract)
 PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE ON DEVELOPMENTS IN LANGUAGE THEORY
, 2006
"... Abstract. We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is shown that the maximal attainable lower bound for each of the above mentioned techniques can be algorithmicall ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
be algorithmically deduced from a canonical finite graph, the so called dependency graph of a regular language. This graph is very helpful when comparing the techniques with each other and with nondeterministic state complexity. In most cases it is shown that for any two techniques the gap between the best bounds
Electronic Colloquium on Computational Complexity, Report No. 27 (2006) Finding Lower Bounds for Nondeterministic State Complexity is Hard
"... Abstract. We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is shown that the maximal attainable lower bound for each of the above mentioned techniques can be algorithmicall ..."
Abstract
 Add to MetaCart
be algorithmically deduced from a canonical finite graph, the so called dependency graph of a regular language. This graph is very helpful when comparing the techniques with each other and with nondeterministic state complexity. In most cases it is shown that for any two techniques the gap between the best bounds
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
simple notion of monotone reducibility and exhibit complete problems. This provides a framework for stating existing results and asking new questions. We show that mNL (monotone nondeterministic logspace) is not closed under complementation, in contrast to Immerman's and Szelepcs &apos
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
, linking more standard concepts of structural complexity, states that if EX P has polynomial size circuits then EXP = Cg = MA. The first part of the proof of the main result extends recent techniques of polynomial extrapolation of truth values used in the single prover case. The second part is a
Multiparty Communication Complexity
, 1989
"... A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain the Boo ..."
Abstract

Cited by 760 (22 self)
 Add to MetaCart
the Boolean answer deterministically with only a polynomial increase in communication with respect to the information lower bound given by the nondeterministic communication complexity of the function.
Results 1  10
of
47,833