树木心
发表于 2025-3-28 17:17:31
In Memoriam Sheng Yu not prevent him from achieving a brilliant academic career. He completed his Ph.D. in 1986 in Waterloo, Canada, under the guidance of Karel Culik II. In the late 1980’s Sheng taught for a few years at Kent State University and after that has been with the Computer Science Department at the University of Western Ontario in London, Canada.
Omnipotent
发表于 2025-3-28 21:17:10
In Search of Most Complex Regular Languageshtly modified versions. The language ..(.,.,.,.) is an extension of ..(.,.,.), obtained by adding an identity input to the minimal DFA of ..(.,.,.). The witness ..(.,.,.,.) and its modified versions work for 14 more combined operations. Thus ..(.,.,.) and ..(.,.,.,.) appear to be universal witnesses for alphabets of size 3 and 4, respectively.
Scleroderma
发表于 2025-3-29 01:36:48
http://reply.papertrans.cn/47/4626/462538/462538_43.png
SCORE
发表于 2025-3-29 05:48:33
http://reply.papertrans.cn/47/4626/462538/462538_44.png
有毛就脱毛
发表于 2025-3-29 11:10:41
How to Synchronize the Heads of a Multitape Automatonpers, we looked at the problem of deciding, given an .-tape automaton of a given type, whether there exists an equivalent synchronized .-tape automaton of the same type. In this paper, we exhibit various classes of multitape automata which can(not) be converted to equivalent synchronized multitape automata.
民间传说
发表于 2025-3-29 14:14:18
Conference proceedings 2012ld in Porto, Portugal, in July 2012. The 21 revised full papers presented together with 5 invited papers and 7 short papers were carefully selected from 53 submissions. The papers cover various topics such as automata applications in formal verification methods, natural language processing, pattern
Endoscope
发表于 2025-3-29 17:12:12
http://reply.papertrans.cn/47/4626/462538/462538_47.png
Surgeon
发表于 2025-3-29 21:59:21
http://reply.papertrans.cn/47/4626/462538/462538_48.png
Hemodialysis
发表于 2025-3-30 03:25:20
http://reply.papertrans.cn/47/4626/462538/462538_49.png
Insul岛
发表于 2025-3-30 07:54:22
Hyper-minimization for Deterministic Tree Automatapresented for (bottom-up) deterministic tree automata, which represent the recognizable tree languages. It runs in time ., where ℓ is the maximal rank of the input symbols, . is the number of transitions, and . is the number of states of the input tree automaton.