首页    期刊浏览 2025年06月25日 星期三
登录注册

文章基本信息

  • 标题:Heyting Algebras and Formal Languages
  • 本地全文:下载
  • 作者:W. Kuich ; N. Sauer ; F. Urbanek
  • 期刊名称:Journal of Universal Computer Science
  • 印刷版ISSN:0948-6968
  • 出版年度:2002
  • 卷号:8
  • 期号:7
  • DOI:10.3217/jucs-008-07-0722
  • 出版社:Graz University of Technology and Know-Center
  • 摘要: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.
  • 关键词:automata, formal languages, lattices
国家哲学社会科学文献中心版权所有