Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 8 / Issue 7

available in:   PDF (184 kB) PS (152 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-008-07-0722


Heyting Algebras and Formal Languages

Werner Kuich (Vienna University of Technology, Austria)

Norbert Sauer (University of Calgary, Canada)

Friedrich Urbanek (Vienna University of Technology, Austria)

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: automata, formal languages, lattices

Categories: F.4.3