On Upper and Lower Bounds on the Length of Alternating Towers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287757" target="_blank" >RIV/00216208:11320/14:10287757 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Upper and Lower Bounds on the Length of Alternating Towers
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mathematical Foundations of Computer Science 2014
ISBN
978-3-662-44465-8
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
315-326
Publisher name
Springer-Verlag Berlin Heidelberg 2014
Place of publication
Berlin
Event location
Budapest
Event date
Aug 25, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—