Publikace na Matematicko-fyzikální fakulta |
2014
Abstrakt
We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata representing the languages in the case there is no infinite tower.