找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: palliative
发表于 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.
发表于 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.
发表于 2025-3-29 00:22:03 | 显示全部楼层
发表于 2025-3-29 05:00:54 | 显示全部楼层
发表于 2025-3-29 09:50:47 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166199.jpg
发表于 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.
发表于 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.
发表于 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.
发表于 2025-3-30 02:30:00 | 显示全部楼层
发表于 2025-3-30 04:04:43 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 11:31
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表