Journal of Symbolic Computation
String-rewriting systems
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A Complete Characterization of Termination of Op 1q - 1r Os
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
On the Termination Problem for One-Rule Semi-Thue System
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Loops of Superexponential Lengths in One-Rule String Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Termination of string rewriting rules that have one pair of overlaps
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of single-threaded one-rule semi-thue systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On One-Rule Grid Semi-Thue Systems
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 0.00 |
A isemi-Thue system with an inhibitor is one having a special symbol, called an iinhibitor, that appears on the right side of every rule but does not appear on the left side of any rule. The main result of this paper is that the uniform halting problem is decidable for the class of such systems. The concept of iinhibitor is related to the concept of iwell-behaved derivation in systems without an inhibitor. The latter concept has received some attention from those interested in the open question as to whether the uniform termination problem for one-rule semi-Thue systems is decidable.