外观 发表于 2025-3-26 22:52:37
Johannes Herbeck,Rapti Siriwardane-de Zoysads due to a length function. The length function, however, takes values in the additive group of polynomials ℤ (and not, as traditionally, in ℕ), which yields various new properties. Non-Archimedean words allow to solve a number of algorithmic problems in geometric and algorithmic group theory. T成绩上升 发表于 2025-3-27 04:33:18
http://reply.papertrans.cn/28/2703/270224/270224_32.png预示 发表于 2025-3-27 07:02:33
Conference proceedings 2011f words and languages; decidability questions; applications of language theory, including: natural computing, image manipulation and compression, text algorithms, cryptography, concurrency, complexity theory and logic; cellular automata and multidimensional patterns; language theory aspects of quantum computing and bio-computing.expire 发表于 2025-3-27 12:57:06
http://reply.papertrans.cn/28/2703/270224/270224_34.png笨拙的你 发表于 2025-3-27 17:41:24
http://reply.papertrans.cn/28/2703/270224/270224_35.png脖子 发表于 2025-3-27 19:35:38
Growth Properties of Power-Free Languagess to some natural unsolved problems. Also, we pay attention to the tools and techniques that made possible the progress in the area and suggest some technical results that would be useful to solve open problems.凶残 发表于 2025-3-27 21:58:26
The Average Transition Complexity of Glushkov and Partial Derivative Automata upper bound for the ratio of the number of states of . to the number of states of ., which is about . for large alphabet sizes. Here we show how to obtain an upper bound for the number of transitions in ., which we then use to get an average case approximation. Some experimental results are presented that illustrate the quality of our estimate.defray 发表于 2025-3-28 02:28:53
http://reply.papertrans.cn/28/2703/270224/270224_38.pngNEXUS 发表于 2025-3-28 09:51:00
http://reply.papertrans.cn/28/2703/270224/270224_39.png散步 发表于 2025-3-28 12:11:19
http://reply.papertrans.cn/28/2703/270224/270224_40.png