Modified Pushdown Automata

This work introduces limited Hromádka's automata as an extension of classical pushdown automata. This extension means that the automaton is able to create new pushdowns, insert input symbols into them, join them and compare with the input string in run time. The number of such pushdowns is limited by choosen constant n . This work also describes the implementation of the application, that realizes the activity of this automata and is looking for the sequence of derivational steps, by which the automaton accepts the input string