Sumários
Aula 2
28 Fevereiro 2023, 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).
Aula 1
14 Fevereiro 2023, 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)
Finite automata (FA). An example.
Sets, alphabets, strings and languages. Operations on languages. (Sipser's book, Chapter zero)
Finite automata (FA). An example.