找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Automata, Languages and Programming; 25th International C Kim G. Larsen,Sven Skyum,Glynn Winskel Conference proceedings 1998 Springer-Verla

[復(fù)制鏈接]
樓主: palliative
41#
發(fā)表于 2025-3-28 17:28:45 | 只看該作者
Nutzentheoretische Lebensqualit?tsmessungarity to be factorizable by the greatest .. We also find a necessary and sufficient condition for a factorization of bisimilarity: quotients by all maximal open congruences are isomorphic. The general results are motivated and illustrated by important examples: transition systems, event structures and presheaves.
42#
發(fā)表于 2025-3-28 21:47:10 | 只看該作者
Gesundheits?konomische Evaluationenoverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separations between seemingly related problems. Our main theorem is the very surprising fact that boundedness is undecidable for Petri nets with Reset arcs.
43#
發(fā)表于 2025-3-29 00:22:03 | 只看該作者
44#
發(fā)表于 2025-3-29 05:00:54 | 只看該作者
45#
發(fā)表于 2025-3-29 09:50:47 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166199.jpg
46#
發(fā)表于 2025-3-29 12:14:46 | 只看該作者
Gesundheits?konomische EvaluationenLet . be a finite monoid: define C.(.) to be the maximum number of bits that need to be exchanged in the .-party communication game to decide membership in any language recognized by . We prove the following:.We also show that when . is in ., C.(.) = O(1) for some . and conjecture that this algebraic condition is also necessary.
47#
發(fā)表于 2025-3-29 17:31:29 | 只看該作者
U. Siebert,N. Mühlberger,O. Sch?ffskiWe consider the problem of coding planar graphs by binary strings. Depending on whether .(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case.
48#
發(fā)表于 2025-3-29 21:22:06 | 只看該作者
An algebraic approach to communication complexity,Let . be a finite monoid: define C.(.) to be the maximum number of bits that need to be exchanged in the .-party communication game to decide membership in any language recognized by . We prove the following:.We also show that when . is in ., C.(.) = O(1) for some . and conjecture that this algebraic condition is also necessary.
49#
發(fā)表于 2025-3-30 02:30:00 | 只看該作者
50#
發(fā)表于 2025-3-30 04:04:43 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 02:12
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
竹北市| 沙坪坝区| 宿迁市| 常宁市| 奉贤区| 连州市| 龙泉市| 格尔木市| 晋宁县| 上饶县| 视频| 云阳县| 龙海市| 民勤县| 石狮市| 昆明市| 山阳县| 扬中市| 凤凰县| 灵台县| 交口县| 延津县| 洛隆县| 巴彦县| 监利县| 镇宁| 突泉县| 固镇县| 嘉定区| 新竹县| 冕宁县| 南召县| 万年县| 阿拉尔市| 阿克陶县| 奉贤区| 宜兴市| 杭州市| 固镇县| 萝北县| 宣化县|