Computability Theory: An Introduction
Computability Theory: An Introduction
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Computational Complexity of Some Problems Involving Congruences on Algebras
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Simple Reachability Problem in Switch Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Algorithms and theory of computation handbook
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
Promptness in w-regular automata
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Decision problems for convex languages
Information and Computation
Two-way unary automata versus logarithmic space
Information and Computation
Journal of Computer and System Sciences
A note on algebras of languages
Theoretical Computer Science
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On some transformation invariants under retiming and resynthesis
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Enforceable security policies revisited
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Descriptional complexity of pushdown store languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Communicative commitments: Model checking and complexity analysis
Knowledge-Based Systems
CRN Elimination and Substitution Bases for Complexity Classes
Fundamenta Informaticae
Entanglement and the complexity of directed graphs
Theoretical Computer Science
On the space complexity of parameterized problems
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
The complexity of bounded synthesis for timed control with partial observability
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Enforceable Security Policies Revisited
ACM Transactions on Information and System Security (TISSEC)
Measuring and analyzing agents' uncertainty in argumentation-based negotiation dialogue games
Expert Systems with Applications: An International Journal
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| Hi-index | 0.01 |
Reducibility and completeness among combinatorial problems can be formulated in terms of space bounds, in some cases refining the polynomial time-reducibility of Cook and Karp. Two versions are defined, by means of Turing machines and by bounded-quantifier formulas. Following are the main results. (1) The problem ''Is there a path between specified nodes of a digraph?'' is shown to be complete for the sets acceptable in nondeterministic log(.) space; (2) The problem ''Given a finite function f: {1,...,n}-{1,...,n}, is there a k such that f^k(1)=n?'' is similarly complete for deterministic log(.) space; and (3) Each of the problems ''Is T(M)=o?'' and ''Is T(M) infinite?'' (for M a deterministic finite automaton) is shown to be complete for nondeterministic (deterministic) log n space in the case in which the alphabet of M is arbitrary (consists of one letter).