Journal of Symbolic Computation
Confluent string rewriting
Simulation of turing machines by a left-linear rewrite rule
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Handbook of theoretical computer science (vol. B)
String-rewriting systems
Some undecidable termination problems for semi-Thue systems
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Example of undecidable problems for 2-generator matrix semigroups
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Termination and derivational complexity of confluent one-rule string-rewriting systems
Theoretical Computer Science
Decidability of Termination of Grid String Rewriting Rules
SIAM Journal on Computing
Semi-Thue Systems with an Inhibitor
Journal of Automated Reasoning
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
On the Termination Problem for One-Rule Semi-Thue System
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The Word Problem for Thue Rewriting Systems
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Word Problem for Thue Systems with a Few Relations
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Termination of {aa ⅾ bc, bb ⅾ ac, cc ⅾ ab}
Information Processing Letters
Undecidability in ω-Regular Languages
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Extension of the decidability of the marked PCP to instances with unique blocks
Theoretical Computer Science
On undecidability bounds for matrix decision problems
Theoretical Computer Science
A Note on the Emptiness of Semigroup Intersections
Fundamenta Informaticae
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Reachability problems in quaternion matrix and rotation semigroups
Information and Computation
Tiling the Plane with a Fixed Number of Polyominoes
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
The Identity Correspondence Problem and Its Applications
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Termination of {aa →bc,bb→ac,cc→ab}
Information Processing Letters
Periodic and infinite traces in matrix semigroups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Lowering undecidability bounds for decision questions in matrices
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A Note on the Emptiness of Semigroup Intersections
Fundamenta Informaticae
Undecidability in ω-Regular Languages
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Reachability problems in quaternion matrix and rotation semigroups
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We show that the accessibility problem, the common descendant problem, the termination problem and the uniform termination problem are undecidable for 3-rules semi-Thue systems. As a corollary we obtain the undecidability of the Post correspondence problem for 7 rules.