决绝
发表于 2025-3-21 18:37:33
书目名称Automata, Languages, and Programming影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0166226<br><br> <br><br>书目名称Automata, Languages, and Programming读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0166226<br><br> <br><br>
外面
发表于 2025-3-21 22:10:28
http://reply.papertrans.cn/17/1663/166226/166226_2.png
记忆法
发表于 2025-3-22 03:51:59
http://reply.papertrans.cn/17/1663/166226/166226_3.png
态学
发表于 2025-3-22 08:32:04
Deciding properties of integral relational automata,RA). The general model checking problem for CTL. formulae over RA is shown ., the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL.+, which includes all ”linear time”
踉跄
发表于 2025-3-22 09:29:17
On the cost of recomputing: tight bounds on pebbling with faults,xities were studied using the “pebbling game” model. We extend this model to the faulty case, where the content of memory cells may be erased. The model captures notions such as “check points” (keeping multiple copies of intermediate results), and “recovery” (partial recomputing in the case of failu
arthroplasty
发表于 2025-3-22 13:26:11
http://reply.papertrans.cn/17/1663/166226/166226_6.png
cancellous-bone
发表于 2025-3-22 17:23:31
Complexity results for multi-pebble automata and their logics,erminism and concurrency. We investigate the succinctness of such machines, and the extent to which this succinctness carries over to make the reasoning problem in propositional dynamic logic (PDL) more difficult. The two main results establish that each additional pebble provides inherent exponenti
微枝末节
发表于 2025-3-22 23:03:00
An analysis of the Core-ML language: Expressive power and type reconstruction, over atomic constants, and let as the only polymorphic construct. We present a synthesis of recent results which characterize this “toy” language‘s expressive power as well as its type reconstruction (or type inference) problem. More specifically: (1) Core-ML can express exactly the ELEMENTARY quer
IRATE
发表于 2025-3-23 01:32:42
Expressiveness of efficient semi-deterministic choice constructs,are no natural determinate-complete query languages known, more restrictive (the .) and more general (the .) notions of query were considered. Here, we show that the advantage of the second approach over the first is not so much in increased expressiveness, but in the ability of expressing queries m
CRAFT
发表于 2025-3-23 05:52:03
Tailoring recursion for complexity,s of global functions for a number of complexity classes for which such algebras have not been known, e.g. for the functions computable in nondeterministic logarithmic space, or in nondeterministic polynomial time. In addition, we present a functional analogue of first-order logic and give a new fun