Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
On the regular structure of prefix rewriting
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Handbook of theoretical computer science (vol. B)
Bottom-up tree pushdown automata: classification and connection with rewrite systems
Theoretical Computer Science
Information and Computation - Special issue on EXPRESS 1997
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Regular symbolic analysis of dynamic networks of pushdown systems
CONCUR 2005 - Concurrency Theory
Reachability Problems on Regular Ground Tree Rewriting Graphs
Theory of Computing Systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Communication of two stacks and rewriting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
The Reachability Problem over Infinite Graphs
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Regularity and context-freeness over word rewriting systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
Motivated by problems in infinite-state verification, we study word rewriting systems that extend mixed prefix/suffix rewriting (short: bifix rewriting). We introduce several types of infix rewriting where infix replacements are subject to the condition that they have to occur next to tag symbols within a given word. Bifix rewriting is covered by the case where tags occur only as end markers. We show results on the reachability relation (or: derivation relation) of such systems depending on the possibility of removing or adding tags. Where possible we strengthen decidability of the derivation relation to the condition that regularity of sets is preserved, resp. that the derivation relation is even rational. Finally, we compare our model to ground tree rewriting systems and exhibit some differences.