On Bifix Systems and Generalizations

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.

[1]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

[2]  Alexander Okhotin,et al.  Communication of Two Stacks and Rewriting , 2006, ICALP.

[3]  J. R. Büchi.  Regular Canonical Systems , 1964 .

[4]  J. Richard Büchi,et al.  Canonical systems which produce periodic sets , 2005, Mathematical systems theory.

[5]  Dietrich Kuske,et al.  Theories of orders on the set of words , 2006, RAIRO Theor. Informatics Appl..

[6]  Richard Mayr.  Process rewrite systems , 1997, EXPRESS.

[7]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[8]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  Kai Salomaa,et al.  Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems , 1988, J. Comput. Syst. Sci..

[10]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[11]  Christof Löding.  Reachability Problems on Regular Ground Tree Rewriting Graphs , 2004, Theory of Computing Systems.

[12]  Christof Löding,et al.  Infinite graphs generated by tree rewriting , 2003 .

[13]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[14]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems , 1994, Theor. Comput. Sci..

[15]  Tayssir Touili,et al.  Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems , 2005, CONCUR.

[16]  Alexander Okhotin,et al.  Computing by commuting , 2006, Theor. Comput. Sci..

[17]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[18]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[19]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .