Abstract
Two-sided language equations are the most general types of language equations. We discuss several approaches to determining whether a solution exists and of determining such a solution. The question of uniqueness is also of interest. However, in general, none of these approaches is guaranteed to work; in fact, it is not known how to determine whether a given system of m two-sided equations in n variables has a solution, even in the case where m = n = 1.
This is a preview of subscription content, log in via an institution to check access.
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). Two-Sided Language Equations. In: Language Equations. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2156-2_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2156-2_12
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