Abstract
The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular constraints on admissible solutions. It is known that this problem is decidable, albeit with very high complexity.
We consider and solve variant problems where the set of solutions is compared to regular constraint sets and where one counts the number of solutions. Our positive results rely on two non-trivial pumping lemmas for Post-embedding languages and their complements.
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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Chambart, P., Schnoebelen, P.: Computing blocker sets for the Regular Post Embedding Problem. In: Proc. DLT 2010. LNCS. Springer, Heidelberg (2010) (to appear)
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)
Cichon, E.A., Tahhan Bittar, E.: Ordinal recursive bounds for Higman’s theorem. Theoretical Computer Science 201(1-2), 63–84 (1998)
Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic 142(1-3), 245–268 (2006)
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)
Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Computational Logic 9(2) (2008)
Lazić, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundamenta Informaticae 88(3), 251–274 (2008)
Lothaire, M. (ed.): Combinatorics on words. Encyclopedia of Mathematics and Its Applications, vol. 17. Cambridge Univ. Press, Cambridge (1983)
Lothaire, M. (ed.): Algebraic combinatorics on words. Encyclopedia of Mathematics and Its Applications, vol. 90. Cambridge Univ. Press, Cambridge (2002)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chambart, P., Schnoebelen, P. (2010). 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) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)