Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Bounded rewriting for linear term rewriting systems has been defined in (I. Durand, G. Senizergues, M. Sylvestre. Termination of linear bounded term rewriting systems. Proceedings of the 21st International Conference on Rewriting Techniques and Applications) as a restriction of the usual notion of rewriting.  extend here this notion to the whole class of left-linear term rewriting systems, and  show that bounded rewriting is effectively inverse-recognizability preserving. The bounded class (BO) is, by definition, the set of left-linear systems for which every derivation can be replaced by a bottom-up derivation. The class BO contains (strictly) several classes of systems which re already known to be inverse-recognizability preserving: the left-linear growing systems, and the inverse right-linear finite-path overlapping systems.
['Irène Durand', 'Marc Sylvestre']
I am writing a research paper on a idea Left-linear Bounded TRSs are Inverse Recognizability Preserving
[{"from": "human", "value": "I am writing a research paper on a idea Left-linear Bounded TRSs are Inverse Recognizability Preserving"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Bounded rewriting for linear term rewriting systems has been defined in (I. Durand, G. Senizergues, M. Sylvestre. Termination of linear bounded term rewriting systems. Proceedings of the 21st International Conference on Rewriting Techniques and Applications) as a restriction of the usual notion of rewriting.  extend here this notion to the whole class of left-linear term rewriting systems, and  show that bounded rewriting is effectively inverse-recognizability preserving. The bounded class (BO) is, by definition, the set of left-linear systems for which every derivation can be replaced by a bottom-up derivation. The class BO contains (strictly) several classes of systems which re already known to be inverse-recognizability preserving: the left-linear growing systems, and the inverse right-linear finite-path overlapping systems."}]