commune
发表于 2025-3-23 10:33:06
http://reply.papertrans.cn/43/4214/421346/421346_11.png
Noisome
发表于 2025-3-23 14:57:36
http://reply.papertrans.cn/43/4214/421346/421346_12.png
seruting
发表于 2025-3-23 21:03:12
http://reply.papertrans.cn/43/4214/421346/421346_13.png
cogitate
发表于 2025-3-24 01:26:57
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata, series and matrices. The use of semirings, formal power series and matrices makes the proofs computational in nature and, consequently, more satisfactory from the mathematical point of view than the customary proofs.
敏捷
发表于 2025-3-24 06:18:26
Regularity and Finiteness Conditions,oth for Algebra and Theoretical Computer Science. This research mainly concerns that part of combinatorics of finite and infinite words over a finite alphabet, which is usually called the theory of “unavoidable” regularities. The book by Lothaire [.] can be considered an excellent introduction to this theory.
沉着
发表于 2025-3-24 07:24:55
https://doi.org/10.1007/978-3-642-59136-5Automaten; Formale Sprachen; Grammatiken; Logik; Syntax; automata; combinatorics on words; formal language;
外向者
发表于 2025-3-24 12:29:14
http://reply.papertrans.cn/43/4214/421346/421346_17.png
时代
发表于 2025-3-24 16:54:42
http://reply.papertrans.cn/43/4214/421346/421346_18.png
漂白
发表于 2025-3-24 21:40:49
http://reply.papertrans.cn/43/4214/421346/421346_19.png
JUST
发表于 2025-3-25 02:47:24
http://reply.papertrans.cn/43/4214/421346/421346_20.png