发牢骚
发表于 2025-3-26 23:59:03
Henning Fernau,Lakshmanan Kuppusamy,Indhumathi Raman
V切开
发表于 2025-3-27 04:03:02
Nathanaël Fijalkow,Hugo Gimbert,Edon Kelmendi,Denis Kuperberg
心神不宁
发表于 2025-3-27 05:20:28
On the Complexity of Determinizing Monitors,l in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly-exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentially more succinct than their CCS process form.
不出名
发表于 2025-3-27 11:14:52
http://reply.papertrans.cn/47/4626/462525/462525_34.png
讽刺滑稽戏剧
发表于 2025-3-27 13:54:23
http://reply.papertrans.cn/47/4626/462525/462525_35.png
iodides
发表于 2025-3-27 20:02:11
http://reply.papertrans.cn/47/4626/462525/462525_36.png
PRISE
发表于 2025-3-28 01:29:36
Complexity of Proper Prefix-Convex Regular Languages,deal, prefix-closed, and prefix-free languages, which were studied elsewhere. Here we concentrate on prefix-convex languages that do not belong to any one of these classes; we call such languages .. We exhibit most complex proper prefix-convex languages, which meet the bounds for the size of the syn
期满
发表于 2025-3-28 03:59:46
Equivalence of Probabilistic ,-Calculus and p-Automata, .-calculus .-calculus and p-automata (parity alternating Markov chain automata) have an equally strong connection. Namely, for every .-calculus formula we can construct a p-automaton that accepts exactly those Markov chains that satisfy the formula. For every p-automaton we can construct a .-calcul
地壳
发表于 2025-3-28 08:45:11
Complexity of Bifix-Free Regular Languages,lar languages. We show that there exist universal bifix-free languages that meet all the bounds for the state complexity of basic operations (Boolean operations, product, star, and reversal). This is in contrast with suffix-free languages, where it is known that there does not exist such languages.
Canary
发表于 2025-3-28 13:11:24
http://reply.papertrans.cn/47/4626/462525/462525_40.png