灾难
发表于 2025-3-23 10:18:52
http://reply.papertrans.cn/24/2321/232038/232038_11.png
分解
发表于 2025-3-23 16:50:34
http://reply.papertrans.cn/24/2321/232038/232038_12.png
只有
发表于 2025-3-23 20:27:48
Propositional calculi of term satisfiability and process logics,
发起
发表于 2025-3-24 00:53:32
http://reply.papertrans.cn/24/2321/232038/232038_14.png
新娘
发表于 2025-3-24 04:33:53
http://reply.papertrans.cn/24/2321/232038/232038_15.png
TAIN
发表于 2025-3-24 08:36:47
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
发表于 2025-3-24 10:42:27
http://reply.papertrans.cn/24/2321/232038/232038_17.png
新陈代谢
发表于 2025-3-24 15:17:57
http://reply.papertrans.cn/24/2321/232038/232038_18.png
Engulf
发表于 2025-3-24 19:21:52
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
发表于 2025-3-25 02:53:36
http://reply.papertrans.cn/24/2321/232038/232038_20.png