scientific article; zbMATH DE number 1405630

zbMath0943.68091MaRDI QIDQ4938609

Takashi Nagaya, Yoshihito Toyama

Publication date: 23 February 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

almost orthogonal growing term rewriting systems

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (10)

Right-linear half-monadic term rewrite systems ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Unnamed Item ⋮ Murg term rewrite systems ⋮ Termination criteria for tree automata completion ⋮ Strong and NV-sequentiality of constructor systems ⋮ Just-in-time ⋮ On-demand strategy annotations revisited: an improved on-demand evaluation strategy ⋮ Context-sensitive rewriting strategies

This page was built for publication: