obdurate
发表于 2025-3-21 18:39:17
书目名称Descriptional Complexity of Formal Systems影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0268286<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0268286<br><br> <br><br>
显示
发表于 2025-3-21 20:20:35
http://reply.papertrans.cn/27/2683/268286/268286_2.png
Femine
发表于 2025-3-22 03:29:31
http://reply.papertrans.cn/27/2683/268286/268286_3.png
troponins
发表于 2025-3-22 06:11:10
http://reply.papertrans.cn/27/2683/268286/268286_4.png
粗糙滥制
发表于 2025-3-22 10:19:00
Most Complex Non-returning Regular Languagesfferent alphabets. We prove that the maximal syntactic semigroup of a non-returning language has . elements and requires at least . generators. We find the maximal state complexities of atoms of non-returning languages. Finally, we show that there exists a most complex non-returning language that me
hair-bulb
发表于 2025-3-22 14:06:30
http://reply.papertrans.cn/27/2683/268286/268286_6.png
hair-bulb
发表于 2025-3-22 19:03:58
Sensing as a Complexity Measure We introduce and study a new complexity measure, based on the . required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and .-regula
手工艺品
发表于 2025-3-22 22:55:49
http://reply.papertrans.cn/27/2683/268286/268286_8.png
Leisureliness
发表于 2025-3-23 01:59:20
Descriptional Complexity and Operations – Two Non-classical Casesdefine . as the set of all integers . such that there are . languages ., ., with .In this paper we study these sets for the operation union, catenation, star, complement, set-subtraction, and intersection and the measure number of accepting states (defined for regular languages) as well as for rever
febrile
发表于 2025-3-23 06:56:18
http://reply.papertrans.cn/27/2683/268286/268286_10.png