Skip to main content
SpringerLink
Log in

Cutting through Regular Post Embedding Problems

  • Conference paper
Book cover Computer Science – Theory and Applications (CSR 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7353))

Included in the following conference series:

Abstract

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.

Supported by ARCUS 2008–11 Île de France-Inde and Grant ANR-11-BS02-001. The first author was partially funded by Tata Consultancy Services.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91–101 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chambart, P., Schnoebelen, P.: Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 265–276. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Chambart, P., Schnoebelen, P.: Mixing Lossy and Perfect Fifo Channels. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 340–355. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Chambart, P., Schnoebelen, P.: The ω-Regular Post Embedding Problem. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 97–111. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: Proc. LICS 2008, pp. 205–216. IEEE Comp. Soc. Press (2008)

    Google Scholar 

  6. Chambart, P., Schnoebelen, P.: Computing Blocker Sets for the Regular Post Embedding Problem. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 136–147. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Chambart, P., Schnoebelen, P.: Pumping and Counting on the Regular Post Embedding Problem. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 64–75. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Fairtlough, M., Wainer, S.S.: Hierarchies of provably recursive functions. In: Buss, S. (ed.) Handbook of Proof Theory. Studies in Logic, ch. 3, vol. 137, pp. 149–207. Elsevier Science (1998)

    Chapter  Google Scholar 

  9. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2), 63–92 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jančar, P., Karandikar, P., Schnoebelen, P.: Unidirectional channel systems can be tested (in preparation, 2012)

    Google Scholar 

  11. Muscholl, A.: Analysis of Communicating Automata. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 50–57. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Schmitz, S., Schnoebelen, P.: Multiply-Recursive Upper Bounds with Higman’s Lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 441–452. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chennai Mathematical Institute, India

    Prateek Karandikar

  2. LSV, ENS Cachan, CNRS, France

    Philippe Schnoebelen

Authors
  1. Prateek Karandikar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St.Petersburg, 191023, St. Petersburg, Russia

    Edward A. Hirsch

  2. University of Turku, 20014, Turku, Finland

    Juhani Karhumäki  & Arto Lepistö  & 

  3. Lobachevky State University of Nizhni Novgorod, 603950, Niszhi Novgorod, Russia

    Michail Prilutskii

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karandikar, P., Schnoebelen, P. (2012). Cutting through Regular Post Embedding Problems. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30642-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30641-9

  • Online ISBN: 978-3-642-30642-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation