Derivation trees of ground term rewriting systems.

DOI10.1006/INCO.1998.2786zbMath1045.68580OpenAlexW1980623818MaRDI QIDQ1854289

Joost Engelfriet

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2786

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Related Items (9)

Intersection of finitely generated congruences over term algebra ⋮ Term rewriting restricted to ground terms. ⋮ On ground tree transformations and congruences induced by tree automata. ⋮ Symbol different term rewrite systems ⋮ Equational tree transformations ⋮ CHAP and rewrite components ⋮ Automata on finite trees ⋮ Congruential complements of ground term rewrite systems ⋮ Restricted ground tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• The Church-Rosser property for ground term-rewriting systems is decidable
• A fast algorithm for constructing a tree automaton recognizing a congruential tree language
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Prefix grammars: An alternative characterization of the regular languages
• Decidable approximations of term rewriting systems
• Regular canonical systems
• Tree generating regular systems
• A Note on Pushdown Store Automata and Regular Systems

This page was built for publication: Derivation trees of ground term rewriting systems.