● Beräkningar och Språk HT2022
(Computations and Languages Autumn 2022)
Assignment 1
1
Figure 1. DFA transition graph
This Finite automata accepts the language L={ w ∈ Σ∗| w does not contain the substring
abc}. The substring of abc can never occur in this DFA
This automata is a DFA because there exists only one path per specific input in each
state.
Theodor Jonsson
Ens18trn
Thjo0102@ad.umu.se
a
Theodor Jonsson
Ens18trn
Thjo0102@ad.umu.se
3. The regular expression: A n = a + (a*+b+a)*
The string has to start with the symbol ‘a’ after that it can have an infinite amount of the
symbol ‘a’ but if it has a ‘b’ that ‘b’ has to be followed by at minimum one a
Theodor Jonsson
Ens18trn
Thjo0102@ad.umu.se