恶梦
发表于 2025-3-21 17:56:16
书目名称Descriptional Complexity of Formal Systems影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0268296<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0268296<br><br> <br><br>
打折
发表于 2025-3-21 22:53:28
http://reply.papertrans.cn/27/2683/268296/268296_2.png
没有希望
发表于 2025-3-22 03:27:39
https://doi.org/10.1007/978-3-031-41574-6We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.
无能力之人
发表于 2025-3-22 07:42:01
Computer Supported Cooperative WorkWe show that it is decidable given an MSO-definable property . of countable words and a Muller context-free grammar ., whether every word in the language generated by . satisfies ..
起草
发表于 2025-3-22 09:52:15
Completely Reachable Automata,We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
Malcontent
发表于 2025-3-22 12:55:57
http://reply.papertrans.cn/27/2683/268296/268296_6.png
Malcontent
发表于 2025-3-22 20:59:55
Self-Verifying Finite Automata and Descriptional Complexity,We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.
apropos
发表于 2025-3-23 00:24:21
http://reply.papertrans.cn/27/2683/268296/268296_8.png
penance
发表于 2025-3-23 02:56:07
http://reply.papertrans.cn/27/2683/268296/268296_9.png
特别容易碎
发表于 2025-3-23 09:29:47
The Irreplaceable Experience of Fieldworkd a minimal .-state DFA ., both defined over an alphabet . with ., such that the minimal DFA for the language .(.).(.) has exactly . states. This improves a similar result in the literature that uses an exponential alphabet.