Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Computational Complexity in the Hyperbolic Plane
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Infinite Relations in Paraconsistent Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
The Root of a Language and Its Complexity
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Modal Satisfiability Is in Deterministic Linear Space
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Amount of Nonconstructivity in Finite Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Complexity problems in real time languages
Information Sciences: an International Journal
Journal of Computer and System Sciences
The enumerability and invariance of complexity classes
Journal of Computer and System Sciences
A characterization of the power of vector machines
Journal of Computer and System Sciences
The reduction of tape reversals for off-line one-tape Turing machines
Journal of Computer and System Sciences
On the computational power of pushdown automata
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Hierarchies of turing machines with restricted tape alphabet size
Journal of Computer and System Sciences
Space bounds for processing contentless inputs
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
Nonexistence of program optimizers in several abstract settings
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Amount of nonconstructivity in deterministic finite automata
Theoretical Computer Science
Synchronized alternating turing machines on four-dimensional input tapes
WSEAS Transactions on Computers
WSEAS Transactions on Computers
Finite state transducers with intuition
UC'10 Proceedings of the 9th international conference on Unconventional computation
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Passively mobile communicating machines that use restricted space
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
Hierarchies of DLOGTIME-uniform circuits
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Solving 3CNF-SAT and HPP in linear time using WWW
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Accepting hybrid networks of evolutionary processors
DNA'04 Proceedings of the 10th international conference on DNA computing
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Accepting networks of splicing processors
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Turing machine-inspired computer science results
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Unambiguous Functions in Logarithmic Space
Fundamenta Informaticae
Hi-index | 0.00 |
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy. The previous complexity classes are shown to possess certain translational properties. An related hierarchy of complexity classes of monotonic functions is examined