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

只看該作者 · 發(fā)表于 2025-3-23 20:27:48

Propositional calculi of term satisfiability and process logics,

只看該作者 · 發(fā)表于 2025-3-24 00:53:32

只看該作者 · 發(fā)表于 2025-3-24 04:33:53

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-24 10:42:27

只看該作者 · 發(fā)表于 2025-3-24 15:17:57

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-25 02:53:36

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 20:42
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved