scientific article; zbMATH DE number 5708984
From MaRDI portal
Publication:3559957
Recommendations
- Right-linear finite path overlapping term rewriting systems effectively preserve recognizability
- A property of left-linear rewrite systems preserving recognizability
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- Computer Science Logic
- Rewriting preserving recognizability of finite tree languages
- Right-linear half-monadic term rewrite systems
- Confluence of right ground term rewriting systems is decidable
- Automated Deduction – CADE-20
- Existence, Uniqueness, and Construction of Rewrite Systems
- Strictly orthogonal left linear rewrite systems and primitive recursion
Cited in
(6)- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- A property of left-linear rewrite systems preserving recognizability
- Rewriting preserving recognizability of finite tree languages
- Right-linear finite path overlapping term rewriting systems effectively preserve recognizability
- Layered transducing term rewriting system and its recognizability preserving property
- Bottom-up rewriting for words and terms
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 Q3559957)