不可思议
发表于 2025-4-1 05:09:17
John T. Povlishock,Yuji Ueda,Enoch P. Weiain how it extends to the more general framework of Garside families. Extending the viewpoint even more, we then consider general quadratic normalisation procedures and characterise Garside normalisation among them.
monogamy
发表于 2025-4-1 08:12:14
Florian G. Hartmann,Daniel Loislso for the . fragment. In particular, the decidability for . is obtained. More generally, for every concatenation hierarchy of regular languages, it is proved that decidability of one of its half levels implies decidability of the intersection of the following half level with its complement.
Sinus-Rhythm
发表于 2025-4-1 11:46:00
Kyle T. S. Pattinson,Richard G. Wiseth don’t cares, with the restriction that no two holes may be within distance two. We present and prove a necessary and sufficient condition for a word of even length (at least eight) to not derive any squares (such word is called non-squareable). The condition can be decided in .(.) time, where . is the length of the word.
configuration
发表于 2025-4-1 18:16:02
https://doi.org/10.1007/978-1-4899-7678-9s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other. We show that all of them are PSPACE-complete.
mitten
发表于 2025-4-1 19:28:44
https://doi.org/10.1007/978-1-0716-3633-6of the free monoid .. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.
flavonoids
发表于 2025-4-2 00:56:25
https://doi.org/10.1007/978-1-0716-3633-6e exists a unique factorization in Lyndon words that are locally decreasing, a relaxation of the condition used in the case of finite words..In a second part, we prove that the factorization of a rational word has a special form and that it can be computed in polynomial time from a rational expression describing the word.
橡子
发表于 2025-4-2 06:36:24
http://reply.papertrans.cn/28/2703/270235/270235_67.png