珍珠无
发表于 2025-3-21 19:43:05
书目名称New Trends in Formal Languages影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0665945<br><br> <br><br>书目名称New Trends in Formal Languages读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0665945<br><br> <br><br>
Adj异类的
发表于 2025-3-21 22:44:42
Conditional context-free languages of finite index,onograph on regulated rewriting. Moreover, we show that conditional context-free languages with context-free conditions of finite index are more powerful than conditional context-free languages with regular conditions of finite index. Furthermore, we study the complexity of membership and non-emptin
infantile
发表于 2025-3-22 01:38:26
The accepting power of finite automata over groups,idered, in comparison with the non-abelian groups. We prove that this is due to the commutativity. Each language accepted by a finite automaton over an abelian group is actually a unordered vector language. Finally, deterministic finite automata over groups are investigated.
套索
发表于 2025-3-22 06:15:19
http://reply.papertrans.cn/67/6660/665945/665945_4.png
钢盔
发表于 2025-3-22 10:58:17
http://reply.papertrans.cn/67/6660/665945/665945_5.png
迎合
发表于 2025-3-22 13:14:23
On restarting automata with rewriting,writing systems on the other hand. The computation of a restarting automaton proceeds in cycles: in each cycle, a bounded substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word..We show a taxonomy of (sub)variants of these automata taki
synovium
发表于 2025-3-22 20:16:15
http://reply.papertrans.cn/67/6660/665945/665945_7.png
Favorable
发表于 2025-3-22 22:47:53
http://reply.papertrans.cn/67/6660/665945/665945_8.png
micronutrients
发表于 2025-3-23 04:26:54
Grammatical inference of colonies,sed on presentation of positive and negative examples of strings is then described, together with an algorithm for extracting a colony from trained neural network. Some examples of the inference of colonies generating/accepting simple context-free languages illustrate the function of the architectur
hemorrhage
发表于 2025-3-23 07:43:05
http://reply.papertrans.cn/67/6660/665945/665945_10.png