Reductions in tree replacement systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3528212 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Complete Sets of Reductions for Some Equational Theories
- Computing in systems described by equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Confluent and Other Types of Thue Systems
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Monadic Thue systems
- New decision algorithms for finitely presented commutative semigroups
- On Uniquely Decipherable Codes with Two Codewords
- On theories with a combinatorial definition of 'equivalence'
- Orderings for term-rewriting systems
- Programming with Equations
- Pushdown tree automata
- Testing for the Church-Rosser property
- The word problem
- Tree acceptors and some of their applications
- Tree generating regular systems
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(30)- One-pass reductions
- scientific article; zbMATH DE number 4024775 (Why is no real title available?)
- A property of left-linear rewrite systems preserving recognizability
- Congruential complements of ground term rewrite systems
- Bottom-up tree pushdown automata and rewrite systems
- On ground-confluence of term rewriting systems
- Decidable approximations of term rewriting systems
- Some undecidability results concerning the property of preserving regularity
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- scientific article; zbMATH DE number 4107710 (Why is no real title available?)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- Decidability of reachability for disjoint union of term rewriting systems
- Learning of Church-Rosser tree rewriting systems
- A learning algorithm for a subclass of tree rewriting systems
- scientific article; zbMATH DE number 5036081 (Why is no real title available?)
- Ground reducibility is EXPTIME-complete
- Decidability of regularity and related properties of ground normal form languages
- Specification and proof in membership equational logic
- CHAP and rewrite components
- scientific article; zbMATH DE number 3911709 (Why is no real title available?)
- Computing linearizations using test sets
- Attacking a public key cryptosystem based on tree replacement
- Sequentiality, monadic second-order logic and tree automata.
- Tree automata for rewrite strategies
- Decidability of confluence and termination of monadic term rewriting systems
- A complete rewriting system for a monoid of tree transformation classes
- Inductive proofs by specification transformations
- On relationship between term rewriting systems and regular tree languages
- Term rewriting restricted to ground terms.
This page was built for publication: Reductions in tree replacement systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082092)
