FLORA
发表于 2025-4-1 04:10:01
Harry K. Kaya,Lawrence A. Laceyis bounded by the number of states of the original automaton, raised to the power of the alphabet size, times the product of the order of the letters, viewed as permutations of the state set. This gives the asymptotic state bound ., if the original regular language is accepted by an automaton with .
SLING
发表于 2025-4-1 09:30:50
Leellen F. Solter,James J. Becnelure. Then we use slightly modified Maslov’s automata to get witnesses over a .-letter alphabet which solves an open problem stated by Caron et al. . We prove that for ., the ternary alphabet is optimal. We also obtain lower bounds . and . in the binary and ternary c
monogamy
发表于 2025-4-1 10:26:27
http://reply.papertrans.cn/27/2683/268291/268291_63.png
Obloquy
发表于 2025-4-1 15:52:49
http://reply.papertrans.cn/27/2683/268291/268291_64.png