Pumping and counting on the regular post embedding problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6199 LNCS, Issue PART 2, 2010, Pages 64-75

  Chambart, Pierre ^a   Schnoebelen, Philippe ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SET; CORRESPONDENCE PROBLEMS; EMBEDDING PROBLEMS; NON-TRIVIAL; SUBWORDS;

LINGUISTICS; PUMPS; TRANSLATION (LANGUAGES);

PROBLEM SOLVING;

EID: 77955316822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14162-1_6     Document Type: Conference Paper

References (14)

1. Abdulla, P. A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for oneclock timed automata. Fundamenta Informaticae 89 (4), 419-450 (2008)
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)
3. 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)
4. 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)
5. Chambart, P., Schnoebelen, P.: Computing blocker sets for the Regular Post Embedding Problem. In: Proc. DLT 2010. LNCS. Springer, Heidelberg (2010) (to appear)
6. 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)
7. Cichon, E. A., Tahhan Bittar, E.: Ordinal recursive bounds for Higman's theorem. Theoretical Computer Science 201 (1-2), 63-84 (1998)
8. 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)
9. Jurdzínski, T.: Leftist grammars are nonprimitive recursive. In: Aceto, L., Damgså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)
10. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Computational Logic 9 (2) (2008)
11. Lazíc, R., Newcomb, T., Ouaknine, J., Roscoe, A. W., Worrell, J.: Nets with tokens which carry data. Fundamenta Informaticae 88 (3), 251-274 (2008)
12. Lothaire, M. (ed.) : Combinatorics on words. Encyclopedia of Mathematics and Its Applications, vol. 17. Cambridge Univ. Press, Cambridge (1983)
13. Lothaire, M. (ed.) : Algebraic combinatorics on words. Encyclopedia of Mathematics and Its Applications, vol. 90. Cambridge Univ. Press, Cambridge (2002)
14. 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)