21. Let G (V,T, S, P) be a CFG. The set of unit pairs is defined as the smallest set X such that X = F(X) where F(X) {(A, A)

21. Let G (V,T, S, P) be a CFG. The set of unit pairs is defined as the smallest set X such that X = F(X) where F(X) {(A, A) | A e V}U{(A,C)| (A, B) E х, В + СЕ P}. 22. The problem of removing ambiguity from a context-free language is in the NP class 23. With multitape Turing machine, it is possible to decide the language L {a”b”c” | n 2 1} in linear time 24. Nondeterministic Turing machines have the same expres siveness as the standard Turing machines.



Source link

Leave a Reply

Your email address will not be published.