All Questions
Tagged with transitivity formal-languages
1 question
3
votes
0
answers
52
views
Does this endomorphism over finite automata have a name?
I found this function that can be applied onto a DFA to produce a DFA. Is there a name for it?
Above: A simple DFA over the alphabet $\{0, 1\}$
Below: The resultant DFA over the alphabet $\{0\mathrm{$...
- 124