Question. Has the following concept, or anything similar, been considered in the literature? Definition. An action/predicate system consists of sets $A$ (the actions) and $X$ (the predicates) such ...
I am taking a class on Automata and Formal Languages and I need to solve an exercise, but I have no idea where to start from. It sounds like this: Decide the coefficients of the words in ...
I am currently pursuing my M.Tech in Digital Image Processing, I want to take admission in PhD program using subjects either Formal Language and Automata Theory or Compiler Design, Can anyone please ...
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 ...
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 ...
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)