Traction
发表于 2025-3-21 17:30:12
书目名称Automata, Languages and Programming影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0166223<br><br> <br><br>书目名称Automata, Languages and Programming读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0166223<br><br> <br><br>
Feigned
发表于 2025-3-21 22:20:31
http://reply.papertrans.cn/17/1663/166223/166223_2.png
悲观
发表于 2025-3-22 01:07:25
A complete and decidable proof system for call-by-value equalities,in a standard call-by-value model, settling an open question of . By the full abstraction theorem of , the logic proves all call-by-value observational congruences between pure terms. Finally, we show that the equations true in the standard model are decidable.
火花
发表于 2025-3-22 07:32:26
http://reply.papertrans.cn/17/1663/166223/166223_4.png
宽大
发表于 2025-3-22 09:07:18
Two-way automata with multiplicity,m to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using spec
Defiance
发表于 2025-3-22 13:52:18
http://reply.papertrans.cn/17/1663/166223/166223_6.png
射手座
发表于 2025-3-22 19:21:01
http://reply.papertrans.cn/17/1663/166223/166223_7.png
BADGE
发表于 2025-3-23 00:13:40
Functions as processes,s a recent step towards a canonical treatment of concurrent processes. With quite simple encodings, two λ-calculus reduction strategies are simulated very closely; each reduction in λ-calculus is mimicked by a short sequence of reductions in π-calculus. Abramsky‘s precongruence of . over λ-
新手
发表于 2025-3-23 04:47:03
A domain-theoretic model for a higher-order process calculus,odel is constructed domain-theoretically and reflects a certain conceptual view-point about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one
parallelism
发表于 2025-3-23 07:45:06
http://reply.papertrans.cn/17/1663/166223/166223_10.png