Differences

This shows you the differences between two versions of the page.

--- lfa:2025:lab01 [2025/10/06 00:35]
tpruteanu
+++ lfa:2025:lab01 [2025/10/07 12:02] (current)
tpruteanu
@@ Line 36: / Line 36: @@
-**2.1.3.** The language of binary words which contain **exactly** two ones.yy
+**2.1.3.** The language of binary words which contain **exactly** two ones.
 /*<hidden>
@@ Line 49: / Line 49: @@
 **2.1.4.** (*) The language of words which encode binary numbers divisible by 3.
-**2.1.5.** (* *) The language of words which encode binary numbers divisible by 3, represent in reverse order (the least significant digit is first).
+**2.1.5.** (* *) The language of words which encode binary numbers divisible by 3, represented in reverse order (the least significant digit is first).
 **2.1.6.** (*) The language of quaternary words (base 4), that follow the rule that every zero is immediately followed by a sequence of at least 2 consecutive threes and every one is immediately followed by a sequence of at most 2 consecutive twos.
@@ Line 111: / Line 111: @@
    iar dacă începe cu b. prima secvență este de al doilea tip */
 ----
 **2.3.1** What happens if we switch all final states to non-final states and vice-versa in a DFA?
@@ Line 119: / Line 121: @@
 **2.3.3** If no such cycle described above exist, L(M) is finite.
-**2.3.4** Show that if you can construct a DFA to accept L, than you can also construct a DFA to accept $ L \cup \{a\}, a \in \Sigma $.
+**2.3.4** Show that if you can construct a DFA to accept L, than you can also construct a DFA to accept $ L \cup \{a\}, \forall a \in \Sigma $.