appall 发表于 2025-3-28 18:30:19

http://reply.papertrans.cn/27/2683/268291/268291_41.png

Ringworm 发表于 2025-3-28 19:39:35

http://reply.papertrans.cn/27/2683/268291/268291_42.png

Reservation 发表于 2025-3-28 23:32:58

Complexity of Two-Dimensional Rank-Reducing Grammars,o-dimensional context-free grammar by restricting the form of productions. Variants (ranks) of the grammar with regard to productions complexity are defined. It is suggested that the lowest-rank variant can be considered as a natural generalization of the regular matrix grammar, which in addition ha

骑师 发表于 2025-3-29 05:29:26

Palindromic Length of Words with Many Periodic Palindromes,ni conjectured that: If . is an infinite word and . is an integer such that . for every factor . of . then . is ultimately periodic..Suppose that . is an infinite word and . is an integer such . for every factor . of .. Let . be the set of all factors . of . that have more than . palindromic prefixe

慢慢冲刷 发表于 2025-3-29 10:12:05

http://reply.papertrans.cn/27/2683/268291/268291_45.png

面包屑 发表于 2025-3-29 12:54:19

http://reply.papertrans.cn/27/2683/268291/268291_46.png

GRIN 发表于 2025-3-29 17:44:21

http://reply.papertrans.cn/27/2683/268291/268291_47.png

novelty 发表于 2025-3-29 21:16:39

http://reply.papertrans.cn/27/2683/268291/268291_48.png

hypnogram 发表于 2025-3-30 01:00:45

http://reply.papertrans.cn/27/2683/268291/268291_49.png

起波澜 发表于 2025-3-30 05:41:43

Insertion-Deletion with Substitutions II,We discuss substitutions as a further type of operations, added to (in particular, one-sided) insertion-deletion systems. This way, we obtain new characterizations of classes of context-sensitive and recursively enumerable languages. Moreover, we obtain new families of languages containing all regular or contained in the context-free languages.
页: 1 2 3 4 [5] 6 7
查看完整版本: Titlebook: Descriptional Complexity of Formal Systems; 22nd International C Galina Jirásková,Giovanni Pighizzini Conference proceedings 2020 Springer