Titlebook: Computation Theory; Fifth Symposium, Zab Andrzej Skowron Conference proceedings 1985 Springer-Verlag Berlin Heidelberg 1985 Computation.Erf

灾难

分解

只有

Propositional calculi of term satisfiability and process logics,

发起

新娘

TAIN

On the log-space reducibility among array languages /preliminary version/,roblem /PAP/, over 1-letter alphabet, which is log-space complete and is accepted by some nondeterministic finite automaton. It follows, that if there exists any deterministic automaton with a finite number of pebbles which accepts PAP then NL=L.

investigate

新陈代谢

Engulf

On the log-space reducibility among array languages /preliminary version/,ring languages. By means of this automaton the complexity classes of array languages are defined. For 2-dimension array languages a generalization of log-space reducibility relation is introduced so that every language which is NL-complete is also complete for the class of array languages accepted b

Fantasy