Tagged Questions
5
votes
0answers
176 views
What is the class of languages accepted by DFAs whose transition monoids are transitive permutation groups?
In the Wiki page
A permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set of states. ..... A formal language is p-regular ...
3
votes
0answers
66 views
Enhancing the monoid structure over a finite alphabet to prove Arden's rule
Suppose you have a finite-state, deterministic automaton, that you wish to convert to a regular expression. A common method, perhaps easier to apply by hand that Yamada's algorithm, is to reduce the ...
