空格
发表于 2025-3-21 17:10:13
书目名称Descriptional Complexity of Formal Systems影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0268293<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0268293<br><br> <br><br>
慢慢冲刷
发表于 2025-3-21 22:31:51
A Field Extension as a Vector SpaceGiven a formal language . specified in various ways, we consider the problem of determining if . is nonempty. If . is indeed nonempty, we find upper and lower bounds on the length of the shortest string in ..
指令
发表于 2025-3-22 02:59:02
Finite Fields I: Basic PropertiesWe study the size-cost of boolean operations on .. We prove an . exponential blow-up for union and intersection, as well as polynomial blow-up for complement.
Cumulus
发表于 2025-3-22 08:36:47
Stephen Williams,Ayanna M. HowardThe . asks for the size of the smallest DFA needed to distinguish between two words of length ≤ . (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.
CLIFF
发表于 2025-3-22 10:45:56
Decidability and Shortest Strings in Formal LanguagesGiven a formal language . specified in various ways, we consider the problem of determining if . is nonempty. If . is indeed nonempty, we find upper and lower bounds on the length of the shortest string in ..
令人发腻
发表于 2025-3-22 13:44:08
http://reply.papertrans.cn/27/2683/268293/268293_6.png
令人发腻
发表于 2025-3-22 20:47:56
Remarks on Separating WordsThe . asks for the size of the smallest DFA needed to distinguish between two words of length ≤ . (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.
向宇宙
发表于 2025-3-22 22:26:46
http://reply.papertrans.cn/27/2683/268293/268293_8.png
Abrupt
发表于 2025-3-23 01:43:00
978-3-642-22599-4Springer-Verlag GmbH Berlin Heidelberg 2011
Fantasy
发表于 2025-3-23 06:30:02
A Field Extension as a Vector Spaceood, the inverse automaton may need a much larger neighborhood. Our interest is to find good upper bounds for the size of this inverse neighborhood. It turns out that a linear algebra approach provides better bounds than any known combinatorial methods. We also consider cellular automata that are no