scholarly journals Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems

2009 ◽  
Vol 2 ◽  
pp. 162-174
Author(s):  
Yoshiharu Kojima ◽  
Masahiko Sakai ◽  
Naoki Nishida ◽  
Keiichirou Kusakari ◽  
Toshiki Sakabe
Keyword(s):  
Term Rewriting ◽  
Term Rewriting Systems ◽  
Context Sensitive ◽  
Rewriting Systems

scholarly journals Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems

2011 ◽  
Vol 4 ◽  
pp. 193-216 ◽  
Author(s):  
Yoshiharu Kojima ◽  
Masahiko Sakai ◽  
Naoki Nishida ◽  
Keiichirou Kusakari ◽  
Toshiki Sakabe
Keyword(s):  
Term Rewriting ◽  
Term Rewriting Systems ◽  
Context Sensitive ◽  
Rewriting Systems

scholarly journals Derivational Complexity and Context-Sensitive Rewriting

2021 ◽  
Author(s):  
Salvador Lucas
Keyword(s):  
Normal Forms ◽  
Term Rewriting ◽  
Linear Term ◽  
The Other ◽  
Term Rewriting Systems ◽  
Context Sensitive ◽  
Rewriting Systems ◽  
Other Hand

AbstractContext-sensitive rewriting is a restriction of rewriting where reduction steps are allowed on specific arguments $$\mu (f)\subseteq \{1,\ldots ,k\}$$ μ ( f ) ⊆ { 1 , … , k } of k-ary function symbols f only. Terms which cannot be further rewritten in this way are called $$\mu $$ μ -normal forms. For left-linear term rewriting systems (TRSs), the so-called normalization via$$\mu $$ μ -normalization procedure provides a systematic way to obtain normal forms by the stepwise computation and combination of intermediate $$\mu $$ μ -normal forms. In this paper, we show how to obtain bounds on the derivational complexity of computations using this procedure by using bounds on the derivational complexity of context-sensitive rewriting. Two main applications are envisaged: Normalization via $$\mu $$ μ -normalization can be used with non-terminating TRSs where the procedure still terminates; on the other hand, it can be used to improve on bounds of derivational complexity of terminating TRSs as it discards many rewritings.

scholarly journals Semantics and strong sequentiality of priority term rewriting systems

1998 ◽  
Vol 208 (1-2) ◽  
pp. 87-110 ◽  
Author(s):  
Masahiko Sakai ◽  
Yoshihito Toyama
Keyword(s):  
Term Rewriting ◽  
Term Rewriting Systems ◽  
Rewriting Systems

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

scholarly journals Infinite normal forms for non-linear term rewriting systems

1995 ◽  
Vol 152 (2) ◽  
pp. 285-303
Author(s):  
Paola Inverardi ◽  
Monica Nesi
Keyword(s):  
Normal Forms ◽  
Term Rewriting ◽  
Linear Term ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Non Linear
Sign in / Sign up

Export Citation Format

Share Document