Abstract
We restrict the underlying alphabet to one letter, denoted by a. Languages over {a} have interesting properties, some of which we derive. Then, we use them to show that any system of explicit equations over the alphabet {a} where the operators are union, unrestricted concatenation, and star have solutions that are expressible as regular expressions in terms of the constant languages only. Most importantly, we provide a complete solution of the problem, including a parametric representation of all solutions if there is more than one. We also study the case (in Section 7.7) where complementation is added to this catalog of operators and show that such equations need not have context-free solutions even if the constants are single letters.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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). Explicit Equations over a One-Letter Alphabet. In: Language Equations. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2156-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2156-2_7
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