scientific article; zbMATH DE number 58292
From MaRDI portal
Publication:4005178
Recommendations
- Ground term rewriting
- On ground word problem of term equation systems
- Term rewriting restricted to ground terms.
- scientific article; zbMATH DE number 850633
- scientific article; zbMATH DE number 4155899
- Congruential complements of ground term rewrite systems
- TERM REWRITE RULES FOR FINITE FIELDS
- scientific article; zbMATH DE number 919844
- Congruences generated by extended ground term rewrite systems
Cited in
(21)- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- Intersection of finitely generated congruences over term algebra
- Term rewriting restricted to ground terms.
- On ground tree transformations and congruences induced by tree automata.
- Congruential complements of ground term rewrite systems
- Restricted ground tree transducers
- Algorithms and reductions for rewriting problems. II.
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- On ground word problem of term equation systems
- Congruence closure of compressed terms in polynomial time
- scientific article; zbMATH DE number 3869406 (Why is no real title available?)
- Congruences generated by extended ground term rewrite systems
- scientific article; zbMATH DE number 1337744 (Why is no real title available?)
- scientific article; zbMATH DE number 1507044 (Why is no real title available?)
- Ground term rewriting
- Symbol different term rewrite systems
- Computing ground reducibility and inductively complete positions
- Bottom-up tree pushdown automata and rewrite systems
- Applying term rewriting methods to finite groups
- Testing for the ground (co-)reducibility property in term-rewriting systems
- On the complexity of recursive path orderings
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 Q4005178)
