描绘 发表于 2025-3-27 00:38:04
http://reply.papertrans.cn/27/2683/268288/268288_31.pngFulsome 发表于 2025-3-27 02:25:36
Yet Another Canonical Nondeterministic Automaton,omaton (DFA), the canonical residual finite state automaton (RFSA), and the átomaton of a language, then the átomaton can be seen as the dual automaton of the minimal DFA, but no such dual has been presented for the canonical RFSA so far. We fill this gap by introducing a new canonical automaton thaburnish 发表于 2025-3-27 08:47:41
http://reply.papertrans.cn/27/2683/268288/268288_33.png解脱 发表于 2025-3-27 10:57:16
https://doi.org/10.1007/978-3-031-13257-5artificial intelligence; automata; automata theory; automation; computational linguistics; computer syste加强防卫 发表于 2025-3-27 15:00:44
978-3-031-13256-8IFIP International Federation for Information Processing 2022LINES 发表于 2025-3-27 18:49:03
http://reply.papertrans.cn/27/2683/268288/268288_36.pnggastritis 发表于 2025-3-28 00:05:08
http://reply.papertrans.cn/27/2683/268288/268288_37.png强所 发表于 2025-3-28 05:55:13
https://doi.org/10.1007/978-94-007-5974-9ds allows to address words directly and not through some integer encoding (of exponential size). Considering alphabets with at least two symbols allows to relate simply and naturally to complexity theory. Indeed, the polynomial-time complexity class (as well as . and exponential time) corresponds to有害处 发表于 2025-3-28 07:56:25
http://reply.papertrans.cn/27/2683/268288/268288_39.png客观 发表于 2025-3-28 12:33:39
https://doi.org/10.1007/978-94-007-5974-9 of scattered factors (also known as subwords or subsequences), which are parts of the word in the correct order but not necessarily consecutive, e.g., . is a scattered factor of . but . is not. Following the idea of scattered factor .-universality (also known as .-richness), we investigate nearly .