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