deforestation
发表于 2025-3-28 14:57:29
http://reply.papertrans.cn/48/4761/476047/476047_41.png
A精确的
发表于 2025-3-28 20:05:38
Constructing a BPE Tokenization DFAm for the efficient construction of deterministic finite automata (DFA) designed to operate directly on tokenizations produced by the popular byte pair encoding (BPE) technique. This makes it possible to apply many existing techniques and algorithms to the tokenized case, such as pattern matching, e
孵卵器
发表于 2025-3-29 00:24:24
http://reply.papertrans.cn/48/4761/476047/476047_43.png
Subdue
发表于 2025-3-29 07:09:18
http://reply.papertrans.cn/48/4761/476047/476047_44.png
修改
发表于 2025-3-29 09:45:15
On Bidirectional Deterministic Finite Automatacal results for bidirectional automata. We show that there exist regular languages, where minimal biDFA models are exponentially smaller than minimal DFA models. We show this for a language that has a structure common to software logs. This makes biDFA especially interesting when inferring models fr
的染料
发表于 2025-3-29 14:34:44
http://reply.papertrans.cn/48/4761/476047/476047_46.png
一条卷发
发表于 2025-3-29 19:00:10
http://reply.papertrans.cn/48/4761/476047/476047_47.png
宠爱
发表于 2025-3-29 22:32:54
http://reply.papertrans.cn/48/4761/476047/476047_48.png
航海太平洋
发表于 2025-3-30 00:24:02
Global One-Counter Tree Automatarough the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem
tympanometry
发表于 2025-3-30 05:35:13
Decision Problems for Subregular Classese in a given subclass of regular languages. We prove .-completeness of this problem on both automata models for the classes of comma-free codes, solid codes, and singleton languages. For the classes of combinational, finitely generated left ideal, star, comet, group, and co-finite languages, the mem