{{{Title}}}
„W“ ist kein Wahrheitswert (wahr/falsch).skov{\'{a}} and Tom{\'{a}}s Masopust}, title = {On Upper and Lower Bounds on the Length of Alternating Towers}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {I}}, year = {2014}, pages = {315--326}, crossref = {DBLP:conf/mfcs/2014-1}, url = {http://dx.doi.org/10.1007/978-3-662-44522-8_27}, doi = {10.1007/978-3-662-44522-8_27}, timestamp = {Thu, 02 Oct 2014 12:21:19 +0200}, biburl = {http://dblp.uni-trier.de/rec/bib/conf/mfcs/HolubJM14}, bibsource = {dblp computer science bibliography, http://dblp.org}
} @proceedings{DBLP:conf/mfcs/2014-1, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, year = {2014}, volume = {8634}, publisher = {Springer}, url = {http://dx.doi.org/10.1007/978-3-662-44522-8}, doi = {10.1007/978-3-662-44522-8}, isbn = {978-3-662-44521-1}, timestamp = {Thu, 02 Oct 2014 12:21:19 +0200}, biburl = {http://dblp.uni-trier.de/rec/bib/conf/mfcs/2014-1}, bibsource = {dblp computer science bibliography, http://dblp.org}}
|Title=On Upper and Lower Bounds on the Length of Alternating Towers
|Year=2014
|Month=August
|Booktitle=Mathematical Foundations of Computer Science (MFCS)
|Pages=315-326
|Publisher=Springer
|Number=8634
|Volume=Lecture Notes in Computer Science
}}
{{{Title}}}
Štěpán HolubŠtěpán Holub, Galina JiráskováGalina Jirásková, Tomáš MasopustTomáš Masopust
- KurzfassungAbstract
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. - Forschungsgruppe:Research Group: Automata Theory„Automata Theory“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Automata Theory
@inproceedings{HJM,
author = {{\v{S}}t{\v{e}}p{\'{a}}n Holub and Galina Jir{\'{a}}skov{\'{a}} and
Tom{\'{a}}{\v{s}} Masopust},
title = {{{{Title}}}},
doi = {10.1007/978-3-662-44522-8_27}
}
