dura-mater 发表于 2025-3-26 21:19:34

http://reply.papertrans.cn/17/1662/166199/166199_31.png

值得尊敬 发表于 2025-3-27 02:14:14

Deciding bisimulation-like equivalences with finite-state processes, that no ‘reasonable’ bisimulation-like equivalence is decidable between state-extended PA processes and finite-state ones. Furthermore, weak bisimilarity with finite-state processes is shown to be undecidable even for state-extended BPP (which are also known as ‘parallel pushdown processes’).

预定 发表于 2025-3-27 07:47:53

http://reply.papertrans.cn/17/1662/166199/166199_33.png

dermatomyositis 发表于 2025-3-27 10:26:53

0302-9743 ta and temporal logic, algorithms, infinite state systems, semantics, approximation, thorem proving, formal languages, pi-calculus, automata and BSP, rewriting, networking and routing, zero-knowledge, quantum computing, etc..978-3-540-64781-2978-3-540-68681-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

deceive 发表于 2025-3-27 17:15:19

http://reply.papertrans.cn/17/1662/166199/166199_35.png

前奏曲 发表于 2025-3-27 19:22:56

https://doi.org/10.1007/978-3-662-11871-9int location, incremental parsing, fundamental data structure problems like maintaining the majority of the prefixes of a string of bits and range queries. We characterise the complexity of maintaining the value of any symmetric function on the prefixes of a bit string.

颠簸下上 发表于 2025-3-27 23:50:02

http://reply.papertrans.cn/17/1662/166199/166199_37.png

地牢 发表于 2025-3-28 05:10:11

http://reply.papertrans.cn/17/1662/166199/166199_38.png

gorgeous 发表于 2025-3-28 09:03:55

http://reply.papertrans.cn/17/1662/166199/166199_39.png

AXIS 发表于 2025-3-28 11:39:01

http://reply.papertrans.cn/17/1662/166199/166199_40.png
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: Automata, Languages and Programming; 25th International C Kim G. Larsen,Sven Skyum,Glynn Winskel Conference proceedings 1998 Springer-Verla