scientific article; zbMATH DE number 1380887

zbMath0939.68681MaRDI QIDQ4705604

Hubert Comon

Publication date: 20 December 1999

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

Mathematics Subject Classification ID

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

Related Items

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