Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

JUCS
2002

favoriteEmaildiscussreport

108views more JUCS 2002»

Heyting Algebras and Formal Languages

13 years 4 months ago

Heyting Algebras and Formal Languages

Download www.jucs.org

: 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

Werner Kuich, Norbert Sauer, Friedrich J. Urbanek

Real-time Traffic

Algebras | Context-sensitive Languages | Formal Languages | JUCS 2002 |

claim paper

Related Content

» Canonicity and Completeness Results for ManyValued Modal Logics

» Heyting algebras with Boolean operators for rough sets and information retrieval applicati...

» Generalized ordinal sums and translations

» Interpolation and FEP for logics of residuated algebras

» A Bialgebraic Approach to Automata and Formal Language Theory

» Nonassociative Lambek Calculus with Additives and ContextFree Languages

» The Reaction Algebra A Formal Language for Event Correlation

» Implementing Hierarchical Features in a Graphically Based Formal Modelling Language

» Relational Completeness of Query Languages for Annotated Databases

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JUCS
Authors	Werner Kuich, Norbert Sauer, Friedrich J. Urbanek

Comments (0)