Abstract
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).
Supported by ESPRIT BR Working Group No.6317 ASMICS
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Boasson, G. Senizergues; NTS languages are deterministic and congruential, J. of Comp. and Syst. Sci. 31 (1985), 332–342
R.V. Book; Decidable sentences of Church-Rosser congruences, Theor. Comput. Sci. 23 (1983), 301–312
K. Madlener, P. Narendran, F. Otto, L. Zhang; On weakly confluent monadic string-rewriting systems, Theor. Comput. Sci. 113 (1993), 119–165
G. Senizergues; The equivalence and inclusion problems for NTS languages, J. of Comp. and Syst. Sci. 31 (1985), 303–331
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Engelfriet, J. (1994). Deciding the NTS property of context-free grammars. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_41
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive