Abstract
The purpose of this chapter is to construct the Language of Translations for the alternating serial (AS) Complex Systems, the top-level language of the Hierarchy of Languages. Strings of this language represent search trees (Section 2.8). A substring that represents the optimal subtree is a solution to the given problem. This subtree reflects application of the one side’ s strategy with the best responses of the other side. The Language of Translations is constructed as a member of the Family of Languages of Reduced Searches. Procedures of evaluation of quality of trajectories and Zones, termination of branches, and tree inspection are introduced as parts of the Grammar of Translations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stilman, B. (2000). Languages of Searches. In: Linguistic Geometry. Operations Research/Computer Science Interfaces Series, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4439-5_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4439-5_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6999-8
Online ISBN: 978-1-4615-4439-5
eBook Packages: Springer Book Archive