the regular languages. As we have seen, each language family of type i is a
proper subset of the family of type i − 1. A diagram (Figure 11.3) exhibits the
relationship clearly. Figure 11.3 shows the original Chomsky hierarchy. We have
also met several other language families that can be fitted into this picture.
Including the families of deterministic context-free languages( LDCF ) and
recursive languages (L REC ), we arrive at the extended hierarchy shown in Figure
11.4.
Figure 11.3
Figure 11.4
Other language families can be defined and their place in Figure 11.4
proper subset of the family of type i − 1. A diagram (Figure 11.3) exhibits the
relationship clearly. Figure 11.3 shows the original Chomsky hierarchy. We have
also met several other language families that can be fitted into this picture.
Including the families of deterministic context-free languages( LDCF ) and
recursive languages (L REC ), we arrive at the extended hierarchy shown in Figure
11.4.
Figure 11.3
Figure 11.4
Other language families can be defined and their place in Figure 11.4