Decidability of the Star Problem in A∗ × {b}∗
✍ Scribed by Paul Gastin; Edward Ochmanski; Antoine Petit; Brigitte Rozoy
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 620 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals a
## Abstract In this paper we prove, modulo Schanuel's Conjecture, that there are algorithms which decide if two exponential polynomials in π are equal in ℝ and if two exponential polynomials in π and __i__ coincide in ℂ. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)