exclusice
发表于 2025-3-28 15:51:22
Stamina: Stabilisation Monoids in Automata Theory,al number of nested Kleene stars needed for expressing the language with a complement-free regular expression. Second, decide limitedness for regular cost functions. Third, decide whether a probabilistic leaktight automaton has value 1, i.e. whether a probabilistic leaktight automaton accepts words
令人苦恼
发表于 2025-3-28 20:02:51
http://reply.papertrans.cn/47/4626/462525/462525_42.png
Gustatory
发表于 2025-3-28 23:06:43
Alignment Distance of Regular Tree Languages,edit-distance, in which we construct an optimal alignment between two trees and compute its cost instead of directly computing the minimum cost of tree edits. The alignment distance is crucial for understanding the structural similarity between trees..We, in particular, consider the following proble
为宠爱
发表于 2025-3-29 05:37:54
Nondeterministic Complexity of Operations on Free and Convex Languages,egular languages. For the operations of intersection, union, concatenation, square, star, reversal, and complementation, we get the tight upper bounds for all considered classes except for complementation on factor- and subword-convex languages. Most of our witnesses are described over optimal alpha
incarcerate
发表于 2025-3-29 10:50:33
http://reply.papertrans.cn/47/4626/462525/462525_45.png
侵略
发表于 2025-3-29 12:54:17
http://reply.papertrans.cn/47/4626/462525/462525_46.png
hermitage
发表于 2025-3-29 15:43:39
On the Conjecture ,,ages that has been recently introduced and that admits interesting properties. This is the first step to prove the conjecture ., which says that for any fixed integer . all the languages recognized by one-way deterministic 1-reversal bounded .-counter machines are in .. We recall that this conjectur
VEN
发表于 2025-3-29 20:53:25
Synchronization Problems in Automata Without Non-trivial Cycles,c automata. We provide upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states, and show that the problem of approximating this length is hard. We also show inapproximability of the problem of computing the rank of a
使显得不重要
发表于 2025-3-30 03:13:13
http://reply.papertrans.cn/47/4626/462525/462525_49.png
Defiance
发表于 2025-3-30 05:45:33
http://reply.papertrans.cn/47/4626/462525/462525_50.png