Nové verze zásobníkových automatů

This thesis investigates multi pushdown automata and introduces their   new modifications based on deep pushdown.  The first modification is Input driven multi deep pushdown automata, which has several deep pushdown lists and the current input symbol determines whether the automaton performs a push operation, a pop operation, an expansion operation or does not touch the stack. The second introduced modification is Regulated pushdown automata by deep pushdown. In addition to ordinary pushdowns, this version contains deep pushdown, which is used to generate the control language. This thesis proves, that the acceptance power of the described variants  is equal to the accepting power of Turing machines.  This thesis also contains view on program realisation of theoretical models, which were described in the theoretical part and introduces a library for the syntax analysis, which is based on it.

pushdown automata, two-pushdown automaton, multi pushdown automata, one-turn pushdown automata, syntax analysis, modified pushdown automata, deep-pushdown automata, deep pushdown expansions, input driven multi deep-pushdown automata, regulated pushdown automata by deep pushdown