Gene408
发表于 2025-3-28 14:47:12
http://reply.papertrans.cn/27/2683/268290/268290_41.png
mastopexy
发表于 2025-3-28 22:40:09
https://doi.org/10.1007/978-94-007-6076-9at finiteness of existential and universal width of an AFA is decidable. Also we give hardness results and give an algorithm to decide whether the existential or universal width of an AFA is bounded by a given integer.
sundowning
发表于 2025-3-28 23:30:29
Field Manual of Diseases on Trees and Shrubswitnesses are described over a four-letter alphabet for cut, and a ten-letter alphabet for square. We also show that the tight upper bound on the syntactic complexity of a language given by an .-state NFA is .. For the square root operation, we provide a lower bound . and an upper bound ..
平淡而无味
发表于 2025-3-29 05:39:57
Field Manual of Diseases on Trees and Shrubsalso show that the respective compressed word problem, where the state sequence is given as a straight-line program, is .-complete. In both cases, we give a direct reduction from the satisfiablity problem for (quantified) boolean formulae.
ROOF
发表于 2025-3-29 10:29:44
http://reply.papertrans.cn/27/2683/268290/268290_45.png
correspondent
发表于 2025-3-29 12:51:07
http://reply.papertrans.cn/27/2683/268290/268290_46.png
GEST
发表于 2025-3-29 18:16:54
http://reply.papertrans.cn/27/2683/268290/268290_47.png
集合
发表于 2025-3-29 19:45:09
http://reply.papertrans.cn/27/2683/268290/268290_48.png
修正案
发表于 2025-3-30 02:46:17
http://reply.papertrans.cn/27/2683/268290/268290_49.png
Mortal
发表于 2025-3-30 08:02:36
http://reply.papertrans.cn/27/2683/268290/268290_50.png