scientific article; zbMATH DE number 176501
From MaRDI portal
Publication:4035665
Recommendations
- scientific article; zbMATH DE number 794243
- Rewriting preserving recognizability of finite tree languages
- Undecidable properties of deterministic top-down tree transducers
- Decidability of regularity and related properties of ground normal form languages
- Decidability of regularity and related properties of ground normal form languages
Cited in
(26)- Tree automata for rewrite strategies
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- scientific article; zbMATH DE number 2090070 (Why is no real title available?)
- More problems in rewriting
- Decidability of regularity and related properties of ground normal form languages
- Losing recognizability
- One-variable context-free hedge automata
- Undecidable properties of deterministic top-down tree transducers
- Rewriting preserving recognizability of finite tree languages
- Open problems in rewriting
- Restricting tree grammars with term rewriting
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- scientific article; zbMATH DE number 17534 (Why is no real title available?)
- Some decidability results on one-pass reductions
- scientific article; zbMATH DE number 1405621 (Why is no real title available?)
- scientific article; zbMATH DE number 1405622 (Why is no real title available?)
- scientific article; zbMATH DE number 794243 (Why is no real title available?)
- scientific article; zbMATH DE number 5722791 (Why is no real title available?)
- scientific article; zbMATH DE number 1390088 (Why is no real title available?)
- Decidable approximations of term rewriting systems
- Some undecidability results concerning the property of preserving regularity
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- Visibly Pushdown Languages and Term Rewriting
- A property of left-linear rewrite systems preserving recognizability
- scientific article; zbMATH DE number 1638661 (Why is no real title available?)
- Decidability of regularity and related properties of ground normal form languages
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 Q4035665)
