Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Intersection-closed full AFL and the recursively enumerable languages
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Tape-reversal bounded turing machine computations
Journal of Computer and System Sciences
The reduction of tape reversals for off-line one-tape Turing machines
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards a Hierarchy of Conformons-P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
An Undecidability Result Concerning Periodic Morphisms
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Simulating one-reversal multicounter machines by partially blind multihead finite automata
Theoretical Computer Science
Decision problems for language equations
Journal of Computer and System Sciences
Computational power of two stacks with restricted communication
Information and Computation
On the universe, disjointness, and containment problems for simple machines
Information and Computation
One-reversal counter machines and multihead automata: revisited
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the containment and equivalence problems for GSMs, transducers, and linear CFGs
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Decidability and shortest strings in formal languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Infinite hierarchies of conformon-p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Communication of two stacks and rewriting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
One-reversal counter machines and multihead automata: Revisited
Theoretical Computer Science
Undecidability in Integer Weighted Finite Automata
Fundamenta Informaticae
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
How to synchronize the heads of a multitape automaton
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On selective unboundedness of VASS
Journal of Computer and System Sciences
Similarity in languages and programs
Theoretical Computer Science
| Hi-index | 0.00 |
Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is, one change from ''pushing'' to ''popping''). It is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondeterministic multicounter acceptors. This provides evidence that reversal bounds are not a natural measure of computational complexity for multitape Turing acceptors.