Abstract
In this chapter, for each \(i \in \{1, \ldots , 11\}\), we prove that there exists a sccf-triple \(\tau \) such that \(\mathrm {Typ}\;\varPsi _{\tau }=\mathrm {Tp}i\). We also prove that, for each \(i \in \{1, \ldots , 10\}\), there exists a restricted sccf-triple \(\tau \) such that \(\mathrm {Typ}\;\varPsi _{\tau }=\mathrm {Tp}i\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity. Global approach. Fundam. Inform. 25(2), 201–214 (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Moshkov, M. (2020). Realizable Global Upper Types of Sccf-Triples. In: Comparative Analysis of Deterministic and Nondeterministic Decision Trees. Intelligent Systems Reference Library, vol 179. Springer, Cham. https://doi.org/10.1007/978-3-030-41728-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41727-7
Online ISBN: 978-3-030-41728-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)