Deciding the NTS property of context-free grammars
An algorithm is presented that is a variation of the one of Senizergues in . 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).
KeywordsPolynomial Time Internal Node Regular Expression Regular Language Finite Automaton
Unable to display preview. Download preview PDF.
- 1.L. Boasson, G. Senizergues; NTS languages are deterministic and congruential, J. of Comp. and Syst. Sci. 31 (1985), 332–342Google Scholar
- 2.R.V. Book; Decidable sentences of Church-Rosser congruences, Theor. Comput. Sci. 23 (1983), 301–312Google Scholar
- 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.G. Senizergues; The equivalence and inclusion problems for NTS languages, J. of Comp. and Syst. Sci. 31 (1985), 303–331Google Scholar