Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM 40, pages 1134–1164, 1993.
2. J.M. Autebert and L. Boasson. The equivalence of pre-NTS grammars is decidable. Math.Systems Theory 25, pages 61–74, 1992.
3. J. Berstel and L. Boasson. Context-free languages. In Handbook of theoretical computer science, vol.B, Chapter 2, pages 59–102. Elsevier, 1991.
4. L. Boasson. Grammaires à non-terminaux séparés. In Proceedings 7th ICALP, pages 105–118. LNCS 85, 1980.
5. L. Boasson and G. Sénizergues. NTS languages are deterministic and congruential. JCSS 31, nr 3, pages 332–342, 1985.