Cutting through Regular Post Embedding Problems

The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability.

[1]  Parosh Aziz Abdulla,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[2]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[3]  S. Buss.  Handbook of proof theory , 1998 .

[4]  Philippe Schnoebelen,et al.  Pumping and Counting on the Regular Post Embedding Problem , 2010, ICALP.

[5]  Philippe Schnoebelen,et al.  Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems , 2007, FSTTCS.

[6]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[7]  Philippe Schnoebelen,et al.  Unidirectional Channel Systems Can Be Tested , 2012, IFIP TCS.

[8]  Philippe Schnoebelen,et al.  The omega-Regular Post Embedding Problem , 2008, FoSSaCS.

[9]  Sanjiva Prasad,et al.  FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings , 2007, FSTTCS.

[10]  Philippe Schnoebelen,et al.  Multiply-Recursive Upper Bounds with Higman's Lemma , 2011, ICALP.

[11]  Philippe Schnoebelen,et al.  The Ordinal Recursive Complexity of Lossy Channel Systems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[12]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[13]  Anca Muscholl,et al.  Analysis of Communicating Automata , 2010, LATA.

[14]  Philippe Schnoebelen,et al.  Mixing Lossy and Perfect Fifo Channels , 2008, CONCUR.

[15]  Stanley S. Wainer,et al.  Chapter III - Hierarchies of Provably Recursive Functions , 1998 .

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

[17]  Philippe Schnoebelen,et al.  Computing Blocker Sets for the Regular Post Embedding Problem , 2010, Developments in Language Theory.

[18]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[19]  P. Schnoebelen,et al.  The ω-Regular Post Embedding Problem ⋆ , 2008 .

[20]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[21]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.