A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Relations Between Time and Tape Complexities
Journal of the ACM (JACM)
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
The recognition problem for the set of perfect squares
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
The complexity of connectivity problems on context-free graph languages
Journal of Computer and System Sciences
On Expressive Description Logics with Composition of Roles in Number Restrictions
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Games with a Uniqueness Property
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Emptiness Relations in Property Systems
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
The Complexity of Model Checking Mobile Ambients
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Atomic Set Constraints with Projection
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Modal Satisfiability Is in Deterministic Linear Space
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs
ISC '01 Proceedings of the 4th International Conference on Information Security
Approximate Pattern Matching is Expressible in Transitive Closure Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Computational Complexity of Some Problems Involving Congruences on Algebras
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Compressing BMC Encodings with QBF
Electronic Notes in Theoretical Computer Science (ENTCS)
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of deciding reachability properties of distributed negotiation schemes
Theoretical Computer Science
Theoretical Computer Science
Automata can show PSpace results for description logics
Information and Computation
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Everything Is PSPACE-Complete in Interaction Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
A Rice-style theorem for parallel automata
Information and Computation
Matching Trace Patterns with Regular Policies
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of unique rational operations
Theoretical Computer Science
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
An Improved Time-Space Lower Bound for Tautologies
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Reconfiguration of List Edge-Colorings in a Graph
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Efficient model checking for LTL with partial order snapshots
Theoretical Computer Science
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Theoretical Computer Science
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
Theoretical Computer Science
The problem of space invariance for sequential machines
Information and Computation
Maze recognizing automata and nondeterministic tape complexity
Journal of Computer and System Sciences
A hierarchy for nondeterministic time complexity
Journal of Computer and System Sciences
A characterization of the power of vector machines
Journal of Computer and System Sciences
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
The tape-complexity of context-independent developmental languages
Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
Some clarifications of the concept of a Garden-of-Eden configuration
Journal of Computer and System Sciences
Splitting a Context-Sensitive Set
Journal of Computer and System Sciences
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
Tape bounds for time-bounded turing machines
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Evaluation of permanents in rings and semirings
Information Processing Letters
Reasoning about the transfer of control
Journal of Artificial Intelligence Research
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
On the complexity of deciding avoidability of sets of partial words
Theoretical Computer Science
A space-time tradeoff for permutation problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Feasibility analysis of sporadic real-time multiprocessor task systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Basic notions in computational complexity
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On the complexity of reconfiguration problems
Theoretical Computer Science
Recurrence and transience for finite probabilistic tables
Theoretical Computer Science
Quasi-interpretations a way to control resources
Theoretical Computer Science
Two-way unary automata versus logarithmic space
Information and Computation
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Unification in the description logic EL without the top concept
CADE'11 Proceedings of the 23rd international conference on Automated deduction
The computational complexity of estimating MCMC convergence time
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
An improved time-space lower bound for tautologies
Journal of Combinatorial Optimization
The Depth of Resolution Proofs
Studia Logica
A note on algebras of languages
Theoretical Computer Science
On the computational complexity of behavioral description-based web service composition
Theoretical Computer Science
On bounded symport/antiport P systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Model-checking hierarchical structures
Journal of Computer and System Sciences
Some recent results concerning deterministic p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Some computational issues in membrane computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Decidable membership problems for finite recurrent systems over sets of naturals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Logspace optimization problems and their approximability properties
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complexity of independent set reconfigurability problems
Theoretical Computer Science
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
Mathematical and Computer Modelling: An International Journal
Treewidth governs the complexity of target set selection
Discrete Optimization
Reconfiguration of list edge-colorings in a graph
Discrete Applied Mathematics
Decidable Elementary Modal Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Complexity of Linear Authorization Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Automata-Based computation of temporal equilibrium models
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Unary coded NP-complete languages in ASPACE (log log n)
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On the complexity of rolling block and alice mazes
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Grid graphs with diagonal edges and the complexity of xmas mazes
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Turing machine-inspired computer science results
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
P- and t-systems in the nets-within-nets-formalism
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
The complexity of rerouting shortest paths
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A Modal Logic for Indiscernibility and Complementarity in Information Systems
Fundamenta Informaticae
Communicative commitments: Model checking and complexity analysis
Knowledge-Based Systems
Complexity Issues in Computational Biology
Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Finding paths between graph colourings: pspace-completeness and superpolynomial distances
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
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
Terminating population protocols via some minimal global knowledge assumptions
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Type-Based complexity analysis for fork processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Integer parameter synthesis for timed automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On selective unboundedness of VASS
Journal of Computer and System Sciences
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Finding optimal Bayesian networks using precedence constraints
The Journal of Machine Learning Research
Reachability analysis for role-based administration of attributes
Proceedings of the 2013 ACM workshop on Digital identity management
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of rerouting shortest paths
Theoretical Computer Science
Improved witnessing and local improvement principles for second-order bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
Extending inclusion dependencies with conditions
Theoretical Computer Science
| Hi-index | 0.01 |
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated. Results include the following: Theorem. A nondeterministic L(n)-tape bounded Turing machine can be simulated by a deterministic [L(n)]^2-tape bounded Turing machine, provided L(n)=log"2n. Computations of nondeterministic machines are shown to correspond to threadings of certain mazes. This correspondence is used to produce a specific set, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeterministic tape complexity classes from deterministic tape complexity classes, then this is one such set.