Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Transition graphs of rewriting systems over unranked trees
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Weak inclusion for recursive XML types
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting and word rewriting.We investigate some preservation properties for two classes of languages of unranked ordered terms under this generalization of term rewriting. The considered classes include languages of hedge automata (HA) and some extension (called CF-HA) with context-free languages in transitions, instead of regular languages.In particular, we show that the set of unranked terms reachable from a given HA language, using a so called inverse context-free rewrite system, is a HA language. The proof, based on a HA completion procedure, reuses and combines known techniques with non-trivial adaptations. Moreover, we prove, with different techniques, that the closure of CF-HA languages with respect to restricted context-free rewrite systems, the symmetric case of the above rewrite systems, is a CF-HA language. As a consequence, the problems of ground reachability and regular hedge model checking are decidable in both cases. We give several counter examples showing that we cannot relax the restrictions.