JUCS - Journal of Universal Computer Science 8(7): 722-736, doi: 10.3217/jucs-008-07-0722
Heyting Algebras and Formal Languages
expand article infoWerner Kuich‡, Norbert Sauer§, Friedrich Urbanek|
‡ Institut für Algebra und Computermathematik, Technische Universität Wien, Wien, Austria§ University of Calgary, Canada| Vienna University of Technology, Vienna, Austria

Corresponding author: Werner Kuich ( kuich@tuwien.ac.at )

© Werner Kuich, Norbert Sauer, Friedrich Urbanek.
This article is freely available under the J.UCS Open Content License.
Citation: Kuich W, Sauer N, Urbanek F (2002) Heyting Algebras and Formal Languages. JUCS - Journal of Universal Computer Science 8(7): 722-736. https://doi.org/10.3217/jucs-008-07-0722
Open Access
Abstract
By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of languages are closed under this exponentiation, e. g., the families of regular and of context-sensitive languages.
Keywords
lattices, automata, formal languages