The number of languages with maximum state complexity

IF 0.6 4区 数学 Q3 MATHEMATICS Algebra Universalis Pub Date : 2022-07-30 DOI:10.1007/s00012-022-00785-2
Bjørn Kjos-Hanssen, Lei Liu
{"title":"The number of languages with maximum state complexity","authors":"Bjørn Kjos-Hanssen,&nbsp;Lei Liu","doi":"10.1007/s00012-022-00785-2","DOIUrl":null,"url":null,"abstract":"<div><p>Câmpeanu and Ho (2004) determined the maximum finite state complexity of finite languages, building on work of Champarnaud and Pin (1989). They stated that it is very difficult to determine the number of maximum-complexity languages. Here we give a formula for this number. We also generalize their work from languages to functions on finite sets.</p></div>","PeriodicalId":50827,"journal":{"name":"Algebra Universalis","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00012-022-00785-2.pdf","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra Universalis","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00012-022-00785-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

Abstract

Câmpeanu and Ho (2004) determined the maximum finite state complexity of finite languages, building on work of Champarnaud and Pin (1989). They stated that it is very difficult to determine the number of maximum-complexity languages. Here we give a formula for this number. We also generalize their work from languages to functions on finite sets.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有最大状态复杂度的语言的数量
Câmpeanu和Ho(2004)在Champarnaud和Pin(1989)的工作基础上确定了有限语言的最大有限状态复杂性。他们表示,很难确定最大复杂度语言的数量。这里我们给出这个数字的一个公式。我们还将他们的工作从语言推广到有限集上的函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Algebra Universalis
Algebra Universalis 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
34
审稿时长
3 months
期刊介绍: Algebra Universalis publishes papers in universal algebra, lattice theory, and related fields. In a pragmatic way, one could define the areas of interest of the journal as the union of the areas of interest of the members of the Editorial Board. In addition to research papers, we are also interested in publishing high quality survey articles.
期刊最新文献
Odd and even Fibonacci lattices arising from a Garside monoid Cartesian closed varieties I: the classification theorem Natural dualities for varieties generated by finite positive MV-chains Quasivarieties of algebras whose compact relative congruences are principal Override and restricted union for partial functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1