Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. ===== Examen LFA ===== **Intrebarea 1:** * AFD * AFN * Expresii regulate 1.1. **Intrebarea 2:** * Conversii * Lema de Pompare * Proprietati de inchidere are LR **Intrebarea 3:** * APD * Gramatici IC **Intrebarea 4:** * Ambiguitate * Forma N. Cholmsky **Intrebarea 5:** * Conversie GIC-APD * Gramatici Regulate 5.1. Fie $math[L] un limbaj acceptat de urmatoarea gramatica: $math[S \leftarrow 0S | 1S | A, A \leftarrow 1 | 0B, B \leftarrow 0 | 1A ] **Intrebarea 6:** * Prop. de inchidere ale LIC * Masini Turing