找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematical Foundations of Computer Science 2015; 40th International S Giuseppe F Italiano,Giovanni Pighizzini,Donald T. Conference proce

[复制链接]
楼主: misperceive
发表于 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.
发表于 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 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 2025-3-25 00:26:47 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-25 10:54
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表