整顿 发表于 2025-3-23 13:02:56

Weighted Automata and Logics on Graphsrom the recent literature for weighted automata and weighted logics on words, trees, pictures, and nested words. Establishing such a general result has been an open problem for weighted logic for some time.

表两个 发表于 2025-3-23 15:33:54

Reversible and Irreversible Computations of Deterministic Finite-State Devices equipped with storages are discussed, where we exemplarily stick with the storage types queue and pushdown store. In particular, the computational capacities, decidability problems, and closure properties are the main topics covered, and we draw attention to the overall picture and some of the main ideas involved.

Serenity 发表于 2025-3-23 21:08:10

0302-9743 omputer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).978-3-662-48056-4978-3-662-48057-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

支架 发表于 2025-3-24 01:56:16

Classes of Languages Generated by the Kleene Star of a WordIn this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form ., where . is a word. We provide effective equational characterisations of these classes, i.e. one can decide using our descriptions whether a given regular language belongs or not to each of them.

豪华 发表于 2025-3-24 05:28:02

http://reply.papertrans.cn/63/6262/626151/626151_15.png

PANT 发表于 2025-3-24 08:28:22

Uniform Generation in Trace Monoidsn the boundary at infinity of the associated monoid. We obtain a product decomposition of the uniform measure at infinity if the trace monoid has several irreducible components—a case where other notions such as Parry measures, are not defined. Random generation algorithms are then examined.

冥界三河 发表于 2025-3-24 14:18:14

http://reply.papertrans.cn/63/6262/626151/626151_17.png

blight 发表于 2025-3-24 18:07:10

Longest Gapped Repeats and Palindromesosition . of the word ., the longest prefix . of .[....] such that . (respectively, .) is a suffix of . (defining thus a gapped repeat . – respectively, palindrome .), and the length of . is subject to various types of restrictions.

音乐会 发表于 2025-3-24 22:53:19

http://reply.papertrans.cn/63/6262/626151/626151_19.png

Left-Atrium 发表于 2025-3-25 00:26:47

http://reply.papertrans.cn/63/6262/626151/626151_20.png
页: 1 [2] 3 4 5 6
查看完整版本: Titlebook: Mathematical Foundations of Computer Science 2015; 40th International S Giuseppe F Italiano,Giovanni Pighizzini,Donald T. Conference proce