The inclusion problem of context-free languages: Some tractable cases

International Journal of Foundations of Computer Science

Volumn 22, Issue 2, 2011, Pages 289-299

  Bertoni, Alberto ^a   Choffrut, Christian ^b   Radicioni, Roberto ^c  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

compressed equality problem; Inclusion problem; rewrite systems

Indexed keywords

EID: 79952139001     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054111008040     Document Type: Conference Paper

References (14)

1. Jean Berstel and Luc Boasson. Formal properties of XML grammars and languages. Acta Inform., 38(9):649-671, 2002.
2. Ronald V. Book. Homogeneous Thue systems and the Church-Rosser property. Dis- crete Math., 48(2-3):137-145, 1984.
3. Y. Cochet. Church-Rosser congruences on free semigroups. In Algebraic theory of semigroups (Proc. Sixth Algebraic Conf., Szeged, 1976), volume 20 of Colloq. Math. Soc. J́anos Bolyai, pages 51-60. North-Holland, Amsterdam, 1979.
4. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Handbook of theoretical computer science, Vol. B, pages 243-320. Elsevier, Amsterdam, 1990.
5. M. Farach and M. Thorup. String matching in Lempel-Ziv compressed strings. Algo- rithmica, 20(4):388-404, 1998. (Pubitemid 128664049)
6. S. A. Greibach and E. P. Friedman. Superdeterministic PDAs: a subcase with a decidable inclusion problem. J. Assoc. Comput. Mach., 27(4):675-700, 1980.
7. J. E. Hopcroft. On the equivalence and containment problems for context-free lan- guages. Math. Systems Theory, 3:119-124, 1969.
8. D. E. Knuth. A characterization of parenthesis languages. Inform. Control, 11(3):269-289, 1967.
9. Yury Lifshits. Processing compressed texts: A tractability border. In Combinatorial Pattern Matching, volume 4580 of Lecture Notes in Comput. Sci., pages 228-240. Springer, Berlin, 2007.
10. Markus Lohrey. Word problems for 2-homogeneous monoids and symmetric logspace. In Mathematical foundations of computer science, 2001 (Maríansḱe Ĺazňe), volume 2136 of Lecture Notes in Comput. Sci., pages 500-511. Springer, Berlin, 2001. (Pubitemid 33322438)
11. Markus Lohrey. Word problems and membership problems on compressed words. SIAM J. Comput., 35(5):1210-1240 (electronic), 2006. (Pubitemid 44599924)
12. Masamichi Miyazaki, Ayumi Shinohara, and Masayuki Takeda. An improved pat- tern matching algorithm for strings in terms of straight-line programs. J. Discrete Algorithms (Oxf.), 1(1):187-204, 2000.
13. Wojciech Plandowski. Testing equivalence of morphisms on context-free languages. In Algorithms-ESA '94 (Utrecht), volume 855 of Lecture Notes in Comput. Sci., pages 460-470. Springer, Berlin, 1994.
14. Wojciech Rytter. Algorithms on compressed strings and arrays. In SOFSEM'99: the- ory and practice of informatics (Milovy), volume 1725 of Lecture Notes in Comput. Sci., pages 48-65. Springer, Berlin, 1999.