Heyting Algebras and Formal Languages

: 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. Key Words: Lattices, automata, formal languages. Category: F.4.3

• Type: Journal
• Year: 2002
• Where: JUCS
• Authors: Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
• Keywords: Algebras, Context-sensitive Languages, Formal Languages, JUCS 2002