可耕种
发表于 2025-3-28 15:06:12
http://reply.papertrans.cn/27/2683/268297/268297_41.png
mighty
发表于 2025-3-28 18:53:20
http://reply.papertrans.cn/27/2683/268297/268297_42.png
Tempor
发表于 2025-3-29 02:41:44
http://reply.papertrans.cn/27/2683/268297/268297_43.png
Erythropoietin
发表于 2025-3-29 04:37:32
http://reply.papertrans.cn/27/2683/268297/268297_44.png
改革运动
发表于 2025-3-29 09:06:22
Invertible Transductions and Iteration,We study iterated transductions, where the basic transductions are given by a class of length-preserving invertible transducers over the binary alphabet. It is shown that in some cases the resulting orbit relation is rational and we determine the complexity of several natural computational problems associated with the iterated transductions.
小画像
发表于 2025-3-29 12:36:43
http://reply.papertrans.cn/27/2683/268297/268297_46.png
格子架
发表于 2025-3-29 16:55:52
http://reply.papertrans.cn/27/2683/268297/268297_47.png
加强防卫
发表于 2025-3-29 20:44:33
Shortest Repetition-Free Words Accepted by Automata,We consider the following problem: given that a finite automaton . of . states accepts at least one .-power-free (resp., overlap-free) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.
FELON
发表于 2025-3-30 00:52:09
http://reply.papertrans.cn/27/2683/268297/268297_49.png
Foment
发表于 2025-3-30 05:49:54
Fifty Years of Cytochrome P450 Researchjections . are accepted by nondeterministic finite automata of size polynomial in .. Therefore, proving super-polynomial lower bounds for . reduces to proving super-polynomial lower bounds for . i.e. nondeterministic finite automata.