Journal of Symbolic Computation
Confluent string rewriting
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
String-rewriting systems
Simulation of Turing machines by a regular rewrite rule
Theoretical Computer Science
Some undecidable termination problems for semi-Thue systems
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
On the (Generalized) Post Correspondence Problem with Lists of Length 2
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Simple Termination is Difficult
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
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
Graph Rewriting Systems with Priorities
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Binary (generalized) post correspondence problem
Theoretical Computer Science
Modelization of deterministic rational relations
Theoretical Computer Science
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Relative undecidability in term rewriting: II. the confluence hierarchy
Information and Computation
Infinite Solutions of Marked Post Correspondence Problem
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Decision Questions on Integer Matrices
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An Undecidability Result Concerning Periodic Morphisms
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Generalized PCP Is Decidable for Marked Morphisms
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Loops of Superexponential Lengths in One-Rule String Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Infinite solutions of marked post correspondence problem
Formal and natural computing
On the undecidability of probabilistic planning and related stochastic optimization problems
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Decidability of the binary infinite post correspondence problem
Discrete Applied Mathematics
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Post Correspondence Problem for short words
Information Processing Letters
Decidability and undecidability of marked PCP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Completion attacks and weak keys of oleshchuk’s public key cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Post correspondence problem with partially commutative alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Complexity of stability and controllability of elementary hybrid systems
Automatica (Journal of IFAC)
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.01 |
For several decision problems about semi-Thue systems , we try to locate the frontier between the decidable and the undecidable from the point of view of the number of rules. We show that the the Termination Problem, the U-Termination Problem, the Accessibility Problem and the Common-Descendant Problem are undecidable for 3 rules semi-Thue systems . As a corollary we obtain the undecidability of the Post-Correspondence Problem for 7 pairs of words.