I need to define a method to construct a finite automata for a finite language L (part of my proof for something else). My idea:
- Create $|L|$ accepting states.
- For each input string $s$ from $L$, create appropriate transitions from a starting state to unique accepting state of s.
I don't know how to formally describe this, or if this idea is even good.