Abstract
We will give a list of problems that have not yet been resolved. This list complements the open problems (mainly directly related to material covered there) that have already been mentioned in the appropriate chapters. The difficulty of the problems ranges from fairly simple to (most likely) impossible to solve. The nature of a book such as this is that it provides a snapshot of what we know about the general theory, at a certain point in time. It should be clear that one might well find solutions to some of the (easier) problems listed here were one to work on them just another six months or a year.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Leiss, E.L. (1999). Open Problems. In: Language Equations. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2156-2_14
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2156-2_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7436-0
Online ISBN: 978-1-4612-2156-2
eBook Packages: Springer Book Archive