Sumários
Class Four
18 Março 2025, 10:00 • Isabel Gama Nunes
Some exercises on DFA and NDFA.
Operations on languages: Union, Concatenation and Star.
First individual evaluation test.
Class Three
11 Março 2025, 10:00 • Isabel Gama Nunes
Exercises on deterministc finite automata.
Non-determinism. Non-Deterministic Finite
Automata (NDFA). Formal definition and representation by state diagrams.
NDFAs have the same computational power than DFAs, that is, they
recognize the same languages. (Sipser's book, Chapter 1.2)
Resolution of some exercises on Non-Deterministic Finite Automata (NDFA).
Class Two
25 Fevereiro 2025, 10:00 • Isabel Gama Nunes
Deterministic
finite automata (DFA). Formal definition and representation by state
diagrams. Formal definition of computation using FA. Language recognized
by a FA. Regular languages. Examples.
(Sipser's book, Chapter 1, Section 1)
Resolution of some exercises on Deterministic Finite Automata (DFA).
Class One
18 Fevereiro 2025, 10:00 • Isabel Gama Nunes
Course sylabus: goals, course description, assessment rules, bibliography.
The fundamental issues of computation theory. Practical implications and foundational aspects.
Sets, alphabets, strings and languages. Operations on languages. (Sipser's book, Chapter zero)
Sets, alphabets, strings and languages. Operations on languages. (Sipser's book, Chapter zero)