和平
发表于 2025-3-25 07:17:27
Adrian-Horia Dediu,Carlos Martín-Vide,Bianca Truth
莎草
发表于 2025-3-25 10:52:28
On the Parikh Membership Problem for FAs, PDAs, and CMslgorithms for a generalization of a tiling problem posed recently by Dana Scott. Finally, we give a classification of the complexity of the membership problem for restricted classes of semilinear sets.
WAX
发表于 2025-3-25 13:51:17
http://reply.papertrans.cn/59/5811/581011/581011_23.png
姑姑在炫耀
发表于 2025-3-25 17:10:44
Conference proceedings 2014age varieties and semigroups; parsing; patterns; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; wei
辫子带来帮助
发表于 2025-3-25 22:01:02
http://reply.papertrans.cn/59/5811/581011/581011_25.png
含铁
发表于 2025-3-26 00:22:03
http://reply.papertrans.cn/59/5811/581011/581011_26.png
大量
发表于 2025-3-26 06:07:30
Picture Codes with Finite Deciphering Delayite deciphering delay sets are an interesting class of string codes that coincide with prefix codes in the case of delay equal to 0. An analogous notion is introduced for picture codes and it is proved that they correspond to a bigger class of decidable picture codes that includes interesting examples and special cases.
暗语
发表于 2025-3-26 08:50:22
http://reply.papertrans.cn/59/5811/581011/581011_28.png
callous
发表于 2025-3-26 13:34:36
Conference proceedings 2014n Madrid, Spain in March 2014..The 45 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 116 submissions. The papers cover the following topics: algebraic language theory; algorithms on automata and words; automata and logic; automata for system ana
GNAW
发表于 2025-3-26 19:25:15
Matchings, Random Walks, and Samplingly smaller than the size of the input that they operate on. In this talk, we will describe some results that illustrate surprising effectiveness of randomization in solving exact and approximate matching problems in sublinear space or time.