Skip to main content
SpringerLink
Log in

Computing Blocker Sets for the Regular Post Embedding Problem

  • Conference paper
Developments in Language Theory (DLT 2010)

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

Included in the following conference series:

Abstract

Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these languages and related decision problems.

Work supported by the Agence Nationale de la Recherche, grant ANR-06-SETIN-001.

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

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. 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 

  2. 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 

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

    Google Scholar 

  4. Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp. Science 3(1), 1–27 (2007)

    MathSciNet  Google Scholar 

  5. Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundamenta Informaticae 89(4), 419–450 (2008)

    MATH  MathSciNet  Google Scholar 

  6. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Computational Logic 9(2) (2008)

    Google Scholar 

  7. Jurdziński, T.: Leftist grammars are nonprimitive recursive. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 51–62. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Chambart, P., Schnoebelen, P.: Toward a compositional theory of leftist grammars and transformations. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 237–251. Springer, Heidelberg (2010)

    Google Scholar 

  9. Gabelaia, D., et al.: Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic 142(1-3), 245–268 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Chambart, P., Schnoebelen, P.: Pumping and counting on the Regular Post Embedding Problem. In: Proc. ICALP 2010. LNCS. Springer, Heidelberg (2010)

    Google Scholar 

  11. Haines, L.H.: On free monoids partially ordered by embedding. J. Combinatorial Theory 76, 94–98 (1969)

    MathSciNet  Google Scholar 

  12. Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory of Computing Systems 30(4), 383–422 (1997)

    MATH  MathSciNet  Google Scholar 

  13. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: Completions. In: Proc. STACS 2009. Leibniz International Proceedings in Informatics, pp. 433–444 (2009)

    Google Scholar 

  14. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design 25(1), 39–65 (2004)

    Article  MATH  Google Scholar 

  15. van Leeuwen, J.: Effective constructions in well-partially-ordered free monoids. Discrete Mathematics 21(3), 237–252 (1978)

    Article  MathSciNet  Google Scholar 

  16. Goubault-Larrecq, J.: On a generalization of a result by Valk and Jantzen. Research Report LSV-09-09, Laboratoire Spécification et Vérification, ENS Cachan, France (May 2009)

    Google Scholar 

  17. Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science 297(1-3), 337–354 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Schnoebelen, P.: Lossy counter machines: A survey. In: Proc. RP 2010. LNCS. Springer, Heidelberg (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV, ENS Cachan, CNRS, 61, av. Pdt. Wilson, F-94230, Cachan, France

    Pierre Chambart & Philippe Schnoebelen

Authors
  1. Pierre Chambart
    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. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chambart, P., Schnoebelen, P. (2010). Computing Blocker Sets for the Regular Post Embedding Problem. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation