Deciding the NTS property of context-free grammars

  • Joost Engelfriet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 812)


An algorithm is presented that is a variation of the one of Senizergues in [4]. It decides the NonTerminal Separation property of context-free grammars in polynomial time. A straightforward generalization of the algorithm decides the NTS property of extended context-free grammars (but not in polynomial time).


Polynomial Time Internal Node Regular Expression Regular Language Finite Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Boasson, G. Senizergues; NTS languages are deterministic and congruential, J. of Comp. and Syst. Sci. 31 (1985), 332–342Google Scholar
  2. 2.
    R.V. Book; Decidable sentences of Church-Rosser congruences, Theor. Comput. Sci. 23 (1983), 301–312Google Scholar
  3. 3.
    K. Madlener, P. Narendran, F. Otto, L. Zhang; On weakly confluent monadic string-rewriting systems, Theor. Comput. Sci. 113 (1993), 119–165Google Scholar
  4. 4.
    G. Senizergues; The equivalence and inclusion problems for NTS languages, J. of Comp. and Syst. Sci. 31 (1985), 303–331Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Joost Engelfriet
    • 1
  1. 1.Department of Computer ScienceLeiden UniversityRA LeidenThe Netherlands

Personalised recommendations