<?xml version="1.0" encoding="utf-8"?>
<!-- generator="FeedCreator 1.7.2-ppt DokuWiki" -->
<?xml-stylesheet href="https://ocw.cs.pub.ro/ppcarte/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://ocw.cs.pub.ro/ppcarte/feed.php">
        <title>books lfa:2026</title>
        <description></description>
        <link>https://ocw.cs.pub.ro/ppcarte/</link>
        <image rdf:resource="https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico" />
       <dc:date>2026-10-05T15:06:19+03:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://ocw.cs.pub.ro/ppcarte/doku.php?id=lfa:2026:lab01&amp;rev=1791189400&amp;do=diff"/>
                <rdf:li rdf:resource="https://ocw.cs.pub.ro/ppcarte/doku.php?id=lfa:2026:team&amp;rev=1791187129&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico">
        <title>books</title>
        <link>https://ocw.cs.pub.ro/ppcarte/</link>
        <url>https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico</url>
    </image>
    <item rdf:about="https://ocw.cs.pub.ro/ppcarte/doku.php?id=lfa:2026:lab01&amp;rev=1791189400&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2026-10-05T11:36:40+03:00</dc:date>
        <title>lfa:2026:lab01</title>
        <link>https://ocw.cs.pub.ro/ppcarte/doku.php?id=lfa:2026:lab01&amp;rev=1791189400&amp;do=diff</link>
        <description>1. Deterministic Finite Automata

	*  Double-circle = final state
	*  Hanging arrow entering state = initial state
	*  Sink state = a state that is not final; once reached, there is no transition that leaves it, thus the DFA will reject; there is a transition that loops in this state for each possible character$ L=\{w \in \{0,1\}^* \text{ | w contains an odd number of ones} \} $$ L \cup \{a\}, \forall a \in \Sigma $</description>
    </item>
    <item rdf:about="https://ocw.cs.pub.ro/ppcarte/doku.php?id=lfa:2026:team&amp;rev=1791187129&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2026-10-05T10:58:49+03:00</dc:date>
        <title>lfa:2026:team</title>
        <link>https://ocw.cs.pub.ro/ppcarte/doku.php?id=lfa:2026:team&amp;rev=1791187129&amp;do=diff</link>
        <description>Limbaje Formale și Automate 2026-2027

Echipa

Curs

	*  Matei POPOVICI

Echipa

	*  Cătălin-Mihail CHIRU
	*  Theodor PRUTEANU
	*  Alexandru TOADER
	*  Razvan-Gabriel ŞERB
	*  Adelin DUMITRACHE
	*  Cosmin ASAVOAIE

Orar

Curs
 Frecvență  Zi  Interval orar   Sala</description>
    </item>
</rdf:RDF>
