热情美女
发表于 2025-3-21 17:41:14
书目名称Descriptional Complexity of Formal Systems影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0268295<br><br> <br><br>书目名称Descriptional Complexity of Formal Systems读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0268295<br><br> <br><br>
Gastric
发表于 2025-3-21 21:12:42
http://reply.papertrans.cn/27/2683/268295/268295_2.png
为现场
发表于 2025-3-22 02:53:38
Most Complex Deterministic Union-Free Regular Languages,ar and boolean operations. We also show that the tight upper bounds on the state complexity of binary operations that take arguments over different alphabets are the same as those for arbitrary regular languages. Furthermore, we prove that the maximal syntactic semigroup of a union-free language has
Eeg332
发表于 2025-3-22 05:59:31
State Grammars with Stores,ith a pushdown and reversal-bounded counters, and these are surprisingly shown to be strictly weaker than state grammars with the standard derivation relation (and no counters). Complexity results of some decision problems involving state grammars with counters are also studied.
animated
发表于 2025-3-22 11:40:58
http://reply.papertrans.cn/27/2683/268295/268295_5.png
是限制
发表于 2025-3-22 15:06:26
http://reply.papertrans.cn/27/2683/268295/268295_6.png
是限制
发表于 2025-3-22 20:35:47
Word Problem Languages for Free Inverse Monoids,oid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context-free; and that the word problem of a free inverse mo
jungle
发表于 2025-3-22 22:48:39
Most Complex Deterministic Union-Free Regular Languages,ed by a deterministic . finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jirásková and Masopust proved that the state complexities of the basic operations reversal, star, product, and boolean operations in determinist
concise
发表于 2025-3-23 03:32:44
Site-Directed Insertion: Decision Problems, Maximality and Minimality,ate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by . we show that one variable equations involving site-directed insertion and regular constants can be s
门闩
发表于 2025-3-23 09:04:05
http://reply.papertrans.cn/27/2683/268295/268295_10.png