向外供接触 发表于 2025-3-28 15:49:49
http://reply.papertrans.cn/28/2703/270225/270225_41.pngepicardium 发表于 2025-3-28 20:29:31
http://reply.papertrans.cn/28/2703/270225/270225_42.pngatopic 发表于 2025-3-29 00:35:37
J. Holfert,H. Thoms,E. Mylius,K. F. Jordanne of a splicing system is the “splicing operation”, a cut-and-paste binary string operation defined by a set of “splicing rules”, quadruples . where . are words over an alphabet .. For two strings . and ., applying the splicing rule . produces the string .. In this paper we focus on a particular ty内疚 发表于 2025-3-29 03:18:23
J. Holfert,H. Thoms,E. Mylius,K. F. Jordanthat there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform random expression with . nodes, then the expected size of the result is bounded by a constant. In our framework, expressions are defined using a combinatorial system, which describesmastoid-bone 发表于 2025-3-29 07:40:17
Schule in Distanz – Kindheit in Krisentinuous direction whenever . is not sofic. This has the corollary that non-sofic beta-shifts are topologically direct prime, i.e. they are not conjugate to direct topological factorizations . of two nontrivial subshifts . and .. We also make some preliminary observations on direct topological facto浮夸 发表于 2025-3-29 14:27:31
http://reply.papertrans.cn/28/2703/270225/270225_46.png多产子 发表于 2025-3-29 17:45:55
Historische Kompetenzen und das Internetmed if all words are prefixes of words in .. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-. of non-linear tree transducers with outITCH 发表于 2025-3-29 20:10:39
Carsten Schulte,Maria Knobelsdorfis located strictly between the local tree grammars and the regular tree grammars. A decision procedure for the problem of determining whether a tree substitution grammar generates a local tree language is provided. Unfortunately, the class of tree substitution languages is neither closed under unioCoronary 发表于 2025-3-30 03:43:45
Historische Kompetenzen und das Internet-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublinear-time ACA classes, analyze their intersection with the regular languages, and, finally,FID 发表于 2025-3-30 05:11:28
https://doi.org/10.1007/978-3-658-31748-5A modifier is a .-ary operator acting on DFAs and producing a DFA. Modifiers are involved in the theory of state complexity. We define and study a class of simple modifiers, called product modifiers, and we link closely the regular operations they encode to boolean operations.