Titlebook: Automata, Languages, and Programming; 21st International C Serge Abiteboul,Eli Shamir Conference proceedings 1994 Springer-Verlag Berlin He

決絕

書目名稱Automata, Languages, and Programming影響因子(影響力)




書目名稱Automata, Languages, and Programming影響因子(影響力)學(xué)科排名




書目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開度




書目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Automata, Languages, and Programming被引頻次




書目名稱Automata, Languages, and Programming被引頻次學(xué)科排名




書目名稱Automata, Languages, and Programming年度引用




書目名稱Automata, Languages, and Programming年度引用學(xué)科排名




書目名稱Automata, Languages, and Programming讀者反饋




書目名稱Automata, Languages, and Programming讀者反饋學(xué)科排名

外面

記憶法

態(tài)學(xué)

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”

踉蹌

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

cancellous-bone

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

微枝末節(jié)

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

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

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