Computing blocker sets for the regular post embedding problem

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

Volumn 6224 LNCS, Issue , 2010, Pages 136-147

  Chambart, Pierre ^a   Schnoebelen, Philippe ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC SOLUTIONS; DECISION PROBLEMS; EMBEDDING PROBLEMS; REGULAR LANGUAGES;

ALGORITHMIC LANGUAGES;

EID: 78049255806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14455-4_14     Document Type: Conference Paper

References (18)

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)
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)
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)
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)
5. Abdulla, P. A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for oneclock timed automata. Fundamenta Informaticae 89(4), 419-450 (2008)
6. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Computational Logic 9(2) (2008)
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)
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)
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)
10. Chambart, P., Schnoebelen, P.: Pumping and counting on the Regular Post Embedding Problem. In: Proc. ICALP 2010. LNCS. Springer, Heidelberg (2010)
11. Haines, L. H.: On free monoids partially ordered by embedding. J. Combinatorial Theory 76, 94-98 (1969)
12. Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory of Computing Systems 30(4), 383-422 (1997)
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)
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)
15. van Leeuwen, J.: Effective constructions in well-partially-ordered free monoids. Discrete Mathematics 21(3), 237-252 (1978)
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)
17. Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science 297 (1-3), 337-354 (2003)
18. Schnoebelen, P.: Lossy counter machines: A survey. In: Proc. RP 2010. LNCS. Springer, Heidelberg (2010)