Abstract
A decision problem is a function with a one-bit output: “yes” or “no.” To specify a decision problem, one must specify
-
the set A of possible inputs, and
-
the subset B ⊆ A of “yes” instances
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
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1997). Strings and Sets. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7309-7
Online ISBN: 978-1-4612-1844-9
eBook Packages: Springer Book Archive