Tagged Questions
5
votes
0answers
174 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 ...
4
votes
1answer
52 views
Gliders, static structures in various (dynamic) systems
Structures, i.e. symmetries over time, appear in various systems:
gliders in cellular automata, like Game of Life or Rule 110,
unmatched string's parts in rewrite systems – unchanged in multiple ...
6
votes
1answer
234 views
Automata theory on infinite words: any video lectures?
I am fun of automata theory. Can you suggest good video lectures on the subject?
(there is a good one here, but it is accessible from RWTH University only)
