On upper and lower bounds on the length of alternating towers

0431318 - MÚ 2015 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Holub, Š. - Jirásková, G. - Masopust, Tomáš
On upper and lower bounds on the length of alternating towers.
Mathematical Foundations of Computer Science 2014. Berlin: Springer, 2014 - (Csuhaj-Varjú, E.; Dietzfelbinger, M.; Ésik, Z.), s. 315-326. Lecture Notes in Computer Science, 8634. ISBN 978-3-662-44521-1.
[International Symposium MFCS 2014 /39./. Budapest (HU), 25.08.2014-29.08.2014]
Institucionální podpora: RVO:67985840
Klíčová slova: alternating tower * separation * bounds
Kód oboru RIV: BA - Obecná matematika
http://link.springer.com/chapter/10.1007%2F978-3-662-44522-8_27

A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. 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. This problem is relevant to the separation problem of regular languages by piecewise testable languages.
Trvalý link: http://hdl.handle.net/11104/0235903