scientific article; zbMATH DE number 1380887

MaRDI QIDQ4705604zbMATH OpenFDO

Authors Hubert Comon

Publication date 20 December 1999

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cited in

(10)

• Semantics and strong sequentiality of priority term rewriting systems
• The first-order theory of linear one-step rewriting is undecidable
• Ordering constraints over feature trees expressed in second-order monadic logic.
• Controlled term rewriting
• Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
• Decidable approximations of term rewriting systems
• Semantics and strong sequentially of priority term rewriting systems
• Decidable call by need computations in term rewriting (extended abstract)
• Soft typing for ordered resolution
• A sequential reduction strategy

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 Q4705604)