Functional encryption for cascade automata

We introduce a Functional Encryption (FE) scheme for the class of languages accepted by extended automata. In an extended automaton, n Deterministic Finite Automata (DFA), each with at most q states, are linked in a cascade such that in each transition the i-th DFA performs its own transition and outputs an input symbol for DFA number i+1modn.