✎ lfa:exam:27ian [books]

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. Fie urmatoarea expresie regulata $math[E = 0\cup(101\cup 010)\cup(01 \cup 10)]

**Intrebarea 2:**
  * Conversii
  * Lema de Pompare
  * Proprietati de inchidere are LR

**Intrebarea 3:**
  * APD
  * Gramatici IC

**Intrebarea 4:**
  * Ambiguitate
  * Forma N. Cholmsky

4.1. De ce este urmatoarea gramatica ambigua? $math[S \leftarrow 0S1\mid 1S0\mid 1S\mid S0\mid \epsilon]

**Intrebarea 5:**
  * Conversie GIC-APD
  * Gramatici Regulate

5.1. Fie $math[L] un limbaj acceptat de urmatoarea gramatica: $math[S \leftarrow 0S \mid 1S \mid A, A \leftarrow 1 \mid 0B, B \leftarrow 0 \mid 1A ]. Comentati fiecare afirmatie de mai jos: (adevarat/fals, si de ce?)
  * Limbajul $math[L] **poate fi un limbaj regulat**
  * Limbajul $math[L] **este** un limbaj regulat
  * Limbajul $math[L] **este** un limbaj regulat dar **nu** independent de context 

**Intrebarea 6:**
  * Prop. de inchidere ale LIC
  * Masini Turing