flower automaton for L = {aa, bb, ba, baa, bba}

I have been an assignment to generate flower automation for the above language. I would like to be explained what flower automation is and how to generate it. Also what is the connection between DFA and flower automation?

Solution

For the given language, this would be a probable solution.

Link to image

Finite automata to regular expression via state removal
Understanding (and forming) the regular expression of this finite automaton
Create a DFA that contains "11" or ends with "10"
How to detect programmatically if two Globs intersect or not in Node.js?
How can a programming language that is specified using a context-free grammar, be capable of expressing a Turing Machine?
How can I construct a grammar that generates this language?
Regular Expression: Language of all those strings which do not contain substring 'bb'
Find a finite automata that for the language L={0,1,2} | needs to include 1002 1,2 are odd and 0 is even
How to escape stable pattern in conway's game of life?
Designing a Turing Machine's state table
Whether this is the general approach for making a DFA for accepting prefix language of a given regular language?
Regular Expression for Automata for Strings that do not end in 01
Evaluating Polish Notation in Java with 2 stacks
DFA- Set of all strings whose 10th symbol from the right end is 1
NFA or DFA accepting # of positions of 4k between 0's
Clarification on Regular Language pumping lemma
Writing the production rules of this finite state machine
what is the meaning of {} in the regular expressions {a + ab}*
What is the difference between (a+b)* and (a*b*)*?
Prove that if ϵ ∈ L1 then L2 ⊆ L2 • L1
The set of all strings over {0,1} that do not contain both the sequence “101” and the sequence “010”
Design DFA accepting decimal strings divisible by 7
Difference between transition diagram and finite automata
Deterministic Pushdown automa vs Non-deterministic pushdown Automata
Does a language compiler use a complex DFA to accept programs?
Complement of non-deterministic context-free language
Can I use stack in Turing Machine?
Convert regular expression to CFG
Using regular expressions check if a particular segment exist in a given string
How to work with weighted automata dataset for Keras Regression