scientific article; zbMATH DE number 4043235

MaRDI QIDQ3780429zbMATH OpenFDO

Authors Michio Oyamaguchi

Publication date 1986

zbMATH Keywords

decidabilityquasi-ground systemreachabilityterm rewriting system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 19765
• Decidable approximations of term rewriting systems
• Term rewriting restricted to ground terms.
• Reachability in conditional term rewriting systems
• Reachability and confluence are undecidable for flat term rewriting systems

Cited in

(15)

• Deciding quasi-reducibility using witnessed test sets
• Decidability of reachability for disjoint union of term rewriting systems
• Decidability for left-linear growing term rewriting systems.
• Term rewriting restricted to ground terms.
• On ground word problem of term equation systems
• Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
• scientific article; zbMATH DE number 4092759 (Why is no real title available?)
• scientific article; zbMATH DE number 19765 (Why is no real title available?)
• scientific article; zbMATH DE number 1222418 (Why is no real title available?)
• Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth
• Reachability in conditional term rewriting systems
• scientific article; zbMATH DE number 1405630 (Why is no real title available?)
• Decidable approximations of term rewriting systems
• Reachability analysis over term rewriting systems
• A distribution semantics for probabilistic term rewriting

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780429)